Õptimal Fault-Tolerant Reachability Labeling in Planar Graphs
share
We show how to assign labels of size Õ(1) to the vertices of a directed planar graph G, such that from the labels of any three vertices s,t,f we can deduce in Õ(1) time whether t is reachable from s in the graph G∖{f}. Previously it was only known how to achieve Õ(1) queries using a centralized Õ(n) size oracle [SODA'21].
READ FULL TEXT