Connectivity Oracles for Graphs Subject to Vertex Failures

DOI10.1137/1.9781611974782.31zbMath1410.68096arXiv1607.06865OpenAlexW2484480607MaRDI QIDQ4575768

Seth Pettie, Ran Duan

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.06865

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Connectivity (05C40)

Related Items (4)

Mincut sensitivity data structures for the insertion of an edge ⋮ An efficient strongly connected components algorithm in the fault tolerant model ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Unnamed Item

This page was built for publication: Connectivity Oracles for Graphs Subject to Vertex Failures