
The FaultTolerant Metric Dimension of Cographs
A vertex set U ⊆ V of an undirected graph G=(V,E) is a resolving set for...
read it

Restorable Shortest Path Tiebreaking for EdgeFaulty Graphs
The restoration lemma by Afek, BremlerBarr, Kaplan, Cohen, and Merritt ...
read it

Distance and routing labeling schemes for cubefree median graphs
Distance labeling schemes are schemes that label the vertices of a graph...
read it

Hardness of exact distance queries in sparse graphs through hub labeling
A distance labeling scheme is an assignment of bitlabels to the vertice...
read it

FaultTolerant EdgeDisjoint Paths – Beyond Uniform Faults
The overwhelming majority of survivable (faulttolerant) network design ...
read it

Eccentricity queries and beyond using Hub Labels
Hub labeling schemes are popular methods for computing distances on road...
read it

Practical I/OEfficient Multiway Separators
We revisit the fundamental problem of I/Oefficiently computing rway se...
read it
FaultTolerant Distance Labeling for Planar Graphs
In faulttolerant 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 utov 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 minorfree graphs) admits faulttolerant 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
Comments
There are no comments yet.