Fault-tolerant distance labeling for planar graphs
From MaRDI portal
Publication:5970814
DOI10.1016/j.tcs.2022.03.020MaRDI QIDQ5970814
Panagiotis Charalampopoulos, Aviv Bar-Natan, Shay Mozes, Oren Weimann, Paweł Gawrychowski
Publication date: 10 May 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.03.020
planar graphs; counting shortest paths; fault-tolerant distance labels; forbidden-set distance labels
68Qxx: Theory of computing