All-pairs min-cut in sparse networks

DOI10.1007/3-540-60692-0_61zbMath1354.68293OpenAlexW1548099937MaRDI QIDQ2956696

Shiva P. Chaudhuri, Christos D. Zaroliagis, Srinivasa R. Arikati

Publication date: 19 January 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0014-A418-4

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items

Characterizing multiterminal flow networks and computing flows in networks of small treewidth ⋮ Dynamic algorithms for graphs of bounded treewidth

This page was built for publication: All-pairs min-cut in sparse networks