How to Use Spanning Trees to Navigate in Graphs
From MaRDI portal
Recommendations
- How to use spanning trees to navigate in graphs
- Navigating in a Graph by Aid of Its Spanning Tree
- Navigating in a graph by aid of its spanning tree metric
- Spanning distribution trees of graphs (extended abstract)
- Spanning trees: A survey
- scientific article; zbMATH DE number 1424297
- Spanning trees of extended graphs
- scientific article; zbMATH DE number 1262806
- Spanning trees in dense directed graphs
- scientific article; zbMATH DE number 1522568
Cites work
- Distance labeling in graphs
- Distributed Computing: A Locality-Sensitive Approach
- Dually Chordal Graphs
- Geometric ad-hoc routing, of theory and practice
- Graph Classes: A Survey
- Graph minors. II. Algorithmic aspects of tree-width
- How to use spanning trees to navigate in graphs
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- Labelling and Implicit Routing in Networks
- Local MST computation with short advice
- Navigating in a Graph by Aid of Its Spanning Tree
- 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
- Proximity-preserving labeling schemes
- Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
- The geometry of graphs and some of its algorithmic applications
- The small-world phenomenon: an algorithmic perspective
- Tree-decompositions with bags of small diameter
Cited in
(4)
This page was built for publication: How to Use Spanning Trees to Navigate in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3182932)
