Distance Approximating Trees: Complexity and Algorithms

DOI10.1007/11758471_26zbMath1183.68421OpenAlexW1591545065MaRDI QIDQ3434562

Feodor F. Dragan, Chenyu Yan

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11758471_26

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

A distance approximating trees ⋮ Bounds of the sum of edge lengths in linear arrangements of trees

This page was built for publication: Distance Approximating Trees: Complexity and Algorithms