Connectivity oracles for failure prone graphs

DOI10.1145/1806689.1806754zbMath1293.05188MaRDI QIDQ2875174

Seth Pettie, Ran Duan

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1806689.1806754

zbMATH Keywords

connectivity

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C40: Connectivity

Related Items

Fault-Tolerant Compact Routing Schemes for General Graphs