Fault-tolerant distance labeling for planar graphs (Q5918639): Difference between revisions

@@ Property / OpenAlex ID @@
+W3174064978
@@ Property / OpenAlex ID: W3174064978 / rank @@
+Normal rank
@@ Property / cites work @@
+Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels
+Normal rank
@@ Property / cites work @@
+Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension
+Normal rank
@@ Property / cites work @@
+Object location using path separators
@@ Property / cites work: Object location using path separators / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal induced universal graphs for bounded-degree graphs
+Normal rank
@@ Property / cites work @@
+Optimal Induced Universal Graphs and Adjacency Labeling for Trees
+Normal rank
@@ Property / cites work @@
+Adjacency Labeling Schemes and Induced-Universal Graphs
+Normal rank
@@ Property / cites work @@
+Q5743393
@@ Property / cites work: Q5743393 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5091049
@@ Property / cites work: Q5091049 / rank @@
+Normal rank
@@ Property / cites work @@
+Short Labels by Traversal and Jumping
@@ Property / cites work: Short Labels by Traversal and Jumping / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple-Source Shortest Paths in Embedded Graphs
@@ Property / cites work: Multiple-Source Shortest Paths in Embedded Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Almost optimal distance oracles for planar graphs
@@ Property / cites work: Almost optimal distance oracles for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Distance Oracles for Planar Graphs with Failing Vertices
+Normal rank
@@ Property / cites work @@
+Compact labelings for efficient first-order model-checking
+Normal rank
@@ Property / cites work @@
+Constrained-path labellings on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+A near-linear-time algorithm for computing replacement paths in planar directed graphs
+Normal rank
@@ Property / cites work @@
+Planar graphs, negative weight edges, shortest paths, and near linear time
+Normal rank
@@ Property / cites work @@
+Subjective-cost policy routing
@@ Property / cites work: Subjective-cost policy routing / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
+Normal rank
@@ Property / cites work @@
+Q4796196
@@ Property / cites work: Q4796196 / rank @@
+Normal rank
@@ Property / cites work @@
+Distance labeling in graphs
@@ Property / cites work: Distance labeling in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607915
@@ Property / cites work: Q4607915 / rank @@
+Normal rank
@@ Property / cites work @@
+Sublinear-space distance labeling using hubs
@@ Property / cites work: Sublinear-space distance labeling using hubs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5663904
@@ Property / cites work: Q5663904 / rank @@
+Normal rank
@@ Property / cites work @@
+Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
+Normal rank
@@ Property / cites work @@
+An Optimal Labeling for Node Connectivity
@@ Property / cites work: An Optimal Labeling for Node Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Improved algorithms for min cut and max flow in undirected planar graphs
+Normal rank
@@ Property / cites work @@
+Implicat Representation of Graphs
@@ Property / cites work: Implicat Representation of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications
+Normal rank
@@ Property / cites work @@
+Labeling Schemes for Flow and Connectivity
@@ Property / cites work: Labeling Schemes for Flow and Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921664
@@ Property / cites work: Q2921664 / rank @@
+Normal rank
@@ Property / cites work @@
+Structured recursive separator decompositions for planar graphs in linear time
+Normal rank
@@ Property / cites work @@
+Shortest paths in directed planar graphs with negative lengths
+Normal rank
@@ Property / cites work @@
+Labeling schemes for vertex connectivity
@@ Property / cites work: Labeling schemes for vertex connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time
+Normal rank
@@ Property / cites work @@
+Proximity-preserving labeling schemes
@@ Property / cites work: Proximity-preserving labeling schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Informative labeling schemes for graphs
@@ Property / cites work: Informative labeling schemes for graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Near Optimal Adjacency Labeling Schemes for Power-Law Graphs
+Normal rank
@@ Property / cites work @@
+Compact oracles for reachability and approximate distances in planar digraphs
+Normal rank
@@ Property / cites work @@
+Compact Forbidden-Set Routing
@@ Property / cites work: Compact Forbidden-Set Routing / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417665
@@ Property / cites work: Q5417665 / rank @@
+Normal rank