I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs

DOI10.1007/978-3-319-04657-0_19zbMath1408.68110OpenAlexW2179557471MaRDI QIDQ5746257

G. Sajith, Alka Bhushan

Publication date: 18 February 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04657-0_19

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

This page was built for publication: I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs