DeepAI AI Chat
Log In Sign Up

Fault-Tolerant Distance Labeling for Planar Graphs

by   Aviv Bar-Natan, et al.

In fault-tolerant distance labeling we wish to assign short labels to the vertices of a graph G such that from the labels of any three vertices u,v,f we can infer the u-to-v distance in the graph G∖{f}. We show that any directed weighted planar graph (and in fact any graph in a graph family with O(√(n))-size separators, such as minor-free graphs) admits fault-tolerant distance labels of size O(n^2/3). We extend these labels in a way that allows us to also count the number of shortest paths, and provide additional upper and lower bounds for labels and oracles for counting shortest paths.


page 1

page 2

page 3

page 4


The Fault-Tolerant Metric Dimension of Cographs

A vertex set U ⊆ V of an undirected graph G=(V,E) is a resolving set for...

Polynomial Kernels for Tracking Shortest Paths

Given an undirected graph G=(V,E), vertices s,t∈ V, and an integer k, Tr...

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

The restoration lemma by Afek, Bremler-Barr, Kaplan, Cohen, and Merritt ...

Distance and routing labeling schemes for cube-free median graphs

Distance labeling schemes are schemes that label the vertices of a graph...

Hardness of exact distance queries in sparse graphs through hub labeling

A distance labeling scheme is an assignment of bit-labels to the vertice...

Local certification of graph decompositions and applications to minor-free classes

Local certification consists in assigning labels to the nodes of a netwo...

Fault-Tolerant Edge-Disjoint Paths – Beyond Uniform Faults

The overwhelming majority of survivable (fault-tolerant) network design ...