DeepAI AI Chat
Log In Sign Up

Fault-Tolerant Distance Labeling for Planar Graphs

02/14/2021
by   Aviv Bar-Natan, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/07/2019

The Fault-Tolerant Metric Dimension of Cographs

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

Polynomial Kernels for Tracking Shortest Paths

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

Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

The restoration lemma by Afek, Bremler-Barr, Kaplan, Cohen, and Merritt ...
09/27/2018

Distance and routing labeling schemes for cube-free median graphs

Distance labeling schemes are schemes that label the vertices of a graph...
02/19/2019

Hardness of exact distance queries in sparse graphs through hub labeling

A distance labeling scheme is an assignment of bit-labels to the vertice...
07/30/2021

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

Local certification consists in assigning labels to the nodes of a netwo...
09/10/2020

Fault-Tolerant Edge-Disjoint Paths – Beyond Uniform Faults

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