Vertex connectivity in poly-logarithmic max-flows

DOI10.1145/3743670MaRDI QIDQ6912093zbMATH OpenFDO

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

Publication date 23 October 2025

Published in Journal of the ACM (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

vertex connectivityalgorithmic graph theory

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Flows in graphs (05C21) Connectivity (05C40)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912093)