Better distance labeling for unweighted planar graphs
From MaRDI portal
Publication:832885
DOI10.1007/978-3-030-83508-8_31OpenAlexW3192755352MaRDI QIDQ832885
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
Related Items
Distance Labeling Schemes for $$K_4$$-Free Bridged Graphs, Better distance labeling for unweighted planar graphs, Isometric Universal Graphs, Shorter Labeling Schemes for Planar Graphs, Fault-tolerant distance labeling for planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding small simple cycle separators for 2-connected planar graphs
- Sublinear-space distance labeling using hubs
- A note on exact distance labeling
- Informative labeling schemes for graphs
- Labeling schemes for vertex connectivity
- Adjacency Labeling Schemes and Induced-Universal Graphs
- An Optimal Labeling for Node Connectivity
- Applications of a Planar Separator Theorem
- Implicat Representation of Graphs
- Universal codeword sets and representations of the integers
- 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
- Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
- Optimal Induced Universal Graphs and Adjacency Labeling for Trees
- Labeling Schemes for Flow and Connectivity
- Distance labeling in 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
- On minimal n-universal graphs
- Optimal Distance Labeling Schemes for Trees
- Structured recursive separator decompositions for planar graphs in linear time
- Short Labels by Traversal and Jumping
