Better distance labeling for unweighted planar graphs
From MaRDI portal
Publication:832885
DOI10.1007/978-3-030-83508-8_31OpenAlexW3192755352MaRDI QIDQ832885FDOQ832885
Authors: Paweł Gawrychowski, Przemysław Uznański 
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_31
Cites Work
- Applications of a Planar Separator Theorem
- Distance labeling in graphs
- Labeling Schemes for Flow and Connectivity
- Universal codeword sets and representations of the integers
- Implicat Representation of Graphs
- Informative labeling schemes for graphs
- Finding small simple cycle separators for 2-connected planar graphs
- Title not available (Why is that?)
- Adjacency labeling schemes and induced-universal graphs
- Optimal induced universal graphs and adjacency labeling for trees
- On minimal n-universal graphs
- An optimal labeling for node connectivity
- Labeling schemes for vertex connectivity
- Sublinear-space distance labeling using hubs
- A note on exact distance labeling
- Simpler, faster and shorter labels for distances in graphs
- Optimal induced universal graphs for bounded-degree graphs
- Distance labeling schemes for trees
- Near optimal adjacency labeling schemes for power-law graphs
- Sublinear Distance Labeling
- Better tradeoffs for exact distance oracles in planar graphs
- Near-optimal compression for the planar graph metric
- Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs
- Hardness of exact distance queries in sparse graphs through hub labeling
- Shorter Labeling Schemes for Planar Graphs
- Almost optimal distance oracles for planar graphs
- Optimal distance labeling schemes for trees
- Structured recursive separator decompositions for planar graphs in linear time
- Short Labels by Traversal and Jumping
Cited In (6)
- Isometric universal graphs
- Distance and routing labeling schemes for non-positively curved plane graphs
- Fault-tolerant distance labeling for planar graphs
- Better distance labeling for unweighted planar graphs
- Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs
- Shorter Labeling Schemes for Planar Graphs
This page was built for publication: Better distance labeling for unweighted planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832885)
