Pages that link to "Item:Q5435672"
From MaRDI portal
The following pages link to Compact oracles for reachability and approximate distances in planar digraphs (Q5435672):
Displaying 50 items.
- Search-space size in contraction hierarchies (Q306264) (← links)
- Succinct posets (Q329288) (← links)
- Distributed computing of efficient routing schemes in generalized chordal graphs (Q442251) (← links)
- Space-efficient path-reporting approximate distance oracles (Q517013) (← links)
- Strong-diameter decompositions of minor free graphs (Q613118) (← links)
- On the time-space complexity of reachability queries for preprocessed graphs (Q916395) (← links)
- Constructing labeling schemes through universal matrices (Q973000) (← links)
- On compact representations of all-pairs-shortest-path-distance matrices (Q986563) (← links)
- A note on models for graph representations (Q1008739) (← links)
- Labeling schemes for tree representation (Q1017912) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Metric decompositions of path-separable graphs (Q1679219) (← links)
- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs (Q1727393) (← links)
- Routing in unit disk graphs (Q1742368) (← links)
- Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
- Interval routing in reliability networks (Q1770375) (← links)
- General compact labeling schemes for dynamic trees (Q1954239) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Distance labeling schemes for \(K_4\)-free bridged graphs (Q2105446) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- A parallel bio-inspired shortest path algorithm (Q2218449) (← links)
- Sparse covers for planar graphs and graphs that exclude a fixed minor (Q2249746) (← links)
- Join-reachability problems in directed graphs (Q2254502) (← links)
- Reachability oracles for directed transmission graphs (Q2309470) (← links)
- On vertex rankings of graphs and its relatives (Q2342634) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- Labeling schemes for weighted dynamic trees (Q2464140) (← links)
- Planar graphs, negative weight edges, shortest paths, and near linear time (Q2496320) (← links)
- Planar graphs, via well-orderly maps and trees (Q2502033) (← links)
- Boolean dimension and tree-width (Q2658384) (← links)
- Maintaining shortest paths under deletions in weighted directed graphs (Q2805514) (← links)
- On the path separability of planar graphs (Q2851515) (← 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)
- Compact Oracles for Approximate Distances Around Obstacles in the Plane (Q3527228) (← links)
- Spanners for Directed Transmission Graphs (Q4581909) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- Metric Embedding via Shortest Path Decompositions (Q5071090) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs (Q5100967) (← links)
- A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (Q5111697) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- (Q5111733) (← links)
- (Q5115792) (← links)
- Routing in Polygonal Domains (Q5136225) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Improved Guarantees for Vertex Sparsification in Planar Graphs (Q5208743) (← links)
