Tight Bounds on Vertex Connectivity Under Sampling

DOI10.1145/3086465zbMath1451.05128OpenAlexW2619418495MaRDI QIDQ4962652

Mohsen Ghaffari, George Giakkoupis, Fabian Kuhn, Bernhard Haeupler, Keren Censor-Hillel

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01635743/file/talg2017kvc.pdf

zbMATH Keywords

vertex connectivitygraph sampling

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (1)

Cycle lengths in randomly perturbed graphs

This page was built for publication: Tight Bounds on Vertex Connectivity Under Sampling