Distance approximating spanning trees

DOI10.1007/BFb0023484zbMath1498.05087OpenAlexW1550952795MaRDI QIDQ5048949

Erich Prisner

Publication date: 9 November 2022

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

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

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Related Items

Tree spanners on chordal graphs: complexity and algorithms, Eccentricity approximating trees, Collective additive tree spanners for circle graphs and polygonal graphs, A distance approximating trees, Combinatorial network abstraction by trees and distances, Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences, Collective Additive Tree Spanners of Homogeneously Orderable Graphs, Fast approximation of eccentricities and distances in hyperbolic graphs, The Recognition Problem of Graph Search Trees, Eccentricity function in distance-hereditary graphs, Additive sparse spanners for graphs with bounded length of largest induced cycle

Cites Work

• Unnamed Item
• Completely separable graphs
• Distance-hereditary graphs
• Representation of a finite graph by a set of intervals on the real line
• On Comparability and Permutation Graphs
• Tree Spanners
• Additive graph spanners