Fault-tolerant distance labeling for planar graphs

Aviv Bar-Natan, Panagiotis Charalampopoulos, Paweł Gawrychowski, Shay Mozes, Oren Weimann

Research output: Contribution to journalArticlepeer-review


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(n2/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.

Original languageAmerican English
Pages (from-to)48-59
Number of pages12
JournalTheoretical Computer Science
StatePublished - 29 May 2022


  • Counting shortest paths
  • Fault-tolerant distance labels
  • Forbidden-set distance labels
  • Planar graphs

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Fault-tolerant distance labeling for planar graphs'. Together they form a unique fingerprint.

Cite this