Vertex connectivity in poly-logarithmic max-flows

DOI10.1145/3406325.3451088arXiv2104.00104OpenAlexW3166491318MaRDI QIDQ6087004

Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai, Jason Li, Debmalya Panigrahi, Danupon Nanongkai

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

vertex connectivityalgorithmic graph theory

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Faster connectivity in low-rank hypergraphs via expander decomposition

This page was built for publication: Vertex connectivity in poly-logarithmic max-flows