How to Use Spanning Trees to Navigate in Graphs

DOI10.1007/978-3-642-03816-7_25zbMath1250.68214OpenAlexW2138358032MaRDI QIDQ3182932

Feodor F. Dragan, Yang Xiang

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_25

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Local MST computation with short advice
• The geometry of graphs and some of its algorithmic applications
• Tree-decompositions with bags of small diameter
• How to use spanning trees to navigate in graphs
• Geometric ad-hoc routing
• The small-world phenomenon
• Labelling and Implicit Routing in Networks
• Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
• Navigating in a Graph by Aid of Its Spanning Tree
• Graph minors. II. Algorithmic aspects of tree-width
• Dually Chordal Graphs
• Graph Classes: A Survey
• Distributed Computing: A Locality-Sensitive Approach
• Distance labeling in graphs
• Proximity-preserving labeling schemes
• Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

This page was built for publication: How to Use Spanning Trees to Navigate in Graphs