Fault-tolerant distance labeling for planar graphs
From MaRDI portal
Publication:5918639
DOI10.1007/978-3-030-79527-6_18MaRDI QIDQ5918639
Panagiotis Charalampopoulos, Oren Weimann, Paweł Gawrychowski, Aviv Bar-Natan, Shay Mozes
Publication date: 22 March 2022
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.07154
planar graphs; counting shortest paths; fault-tolerant distance labels; forbidden-set distance labels
68R10: Graph theory (including graph drawing) in computer science
68Mxx: Computer system organization
68Q11: Communication complexity, information complexity