Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms

DOI10.1137/1.9781611975994.126OpenAlexW3000986974MaRDI QIDQ5146912

No author found.

Publication date: 2 February 2021

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

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (4)

Faster connectivity in low-rank hypergraphs via expander decomposition ⋮ On the tree-width of even-hole-free graphs ⋮ Finding densest \(k\)-connected subgraphs ⋮ An explicit construction of graphs of bounded degree that are far from being Hamiltonian

This page was built for publication: Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms