Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
Open Access
- 15 June 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 2249-2256
Abstract
No abstract availableAll Related Versions
Funding Information
- Israel Science Foundation (810\/21)
- European Research Council (803118)
This publication has 41 references indexed in Scilit:
- Better Distance Labeling for Unweighted Planar GraphsAlgorithmica, 2023
- Improved Distance Queries in Planar GraphsLecture Notes in Computer Science, 2011
- Many Distances in Planar GraphsAlgorithmica, 2010
- Compact labelings for efficient first-order model-checkingJournal of Combinatorial Optimization, 2009
- Constrained-Path Labellings on Graphs of Bounded Clique-WidthTheory of Computing Systems, 2009
- An Optimal Labeling for Node Connectivity2009
- Short Labels by Traversal and JumpingElectronic Notes in Discrete Mathematics, 2007
- Approximate Distance Labeling Schemes2001
- Efficient algorithms for shortest path queries in planar digraphsLecture Notes in Computer Science, 1997
- Planar spanners and approximate shortest path queries among obstacles in the plane1996