Pages that link to "Item:Q5177280"
From MaRDI portal
The following pages link to Object location using path separators (Q5177280):
Displaying 27 items.
- Distributed computing of efficient routing schemes in generalized chordal graphs (Q442251) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Space-efficient path-reporting approximate distance oracles (Q517013) (← links)
- Strong-diameter decompositions of minor free graphs (Q613118) (← links)
- Recovering the long-range links in augmented graphs (Q962166) (← links)
- Universal augmentation schemes for network navigability (Q1019170) (← links)
- Metric decompositions of path-separable graphs (Q1679219) (← links)
- A note on exact distance labeling (Q1944109) (← links)
- Distance estimation and object location via rings of neighbors (Q1954208) (← links)
- Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
- Greedy routing and the algorithmic small-world phenomenon (Q2071825) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Sparse covers for planar graphs and graphs that exclude a fixed minor (Q2249746) (← links)
- Greedy routing in small-world networks with power-law degrees (Q2256946) (← links)
- On vertex rankings of graphs and its relatives (Q2342634) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- On the Path Separability of Planar Graphs (Q2851515) (← links)
- Prioritized Metric Structures and Embedding (Q2941541) (← links)
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (Q3012798) (← links)
- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs (Q3408176) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
- Metric Embedding via Shortest Path Decompositions (Q5071090) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
- Labelings vs. embeddings: on distributed and prioritized representations of distances (Q6124827) (← links)
