Better distance labeling for unweighted planar graphs
From MaRDI portal
Publication:6103529
DOI10.1007/s00453-023-01133-zOpenAlexW4376610056MaRDI QIDQ6103529
Przemysław Uznański, Paweł Gawrychowski
Publication date: 5 June 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-023-01133-z
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Better distance labeling for unweighted planar graphs
- Finding small simple cycle separators for 2-connected planar graphs
- Optimally cutting a surface into a disk
- 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
- On Short Noncontractible Cycles in Embedded Graphs
- 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
- 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
