The search functionality is under construction.
The search functionality is under construction.

A Simple Proof of a Minimum Cut Algorithm and Its Applications

Hiroshi NAGAMOCHI, Toshimasa ISHII, Toshihide IBARAKI

  • Full Text Views

    0

  • Cite this

Summary :

For the correctness of the minimum cut algorithm proposed in [H. Nagamochi and T. Ibaraki, Computing edge-connectivity of multigraphs and capacitated graphs, SIAM J. Discrete Mathematics, 5, 1992, pp. 54-66], several simple proofs have been presented so far. This paper gives yet another simple proof. As a byproduct, it can provide an O(m log n) time algorithm that outputs a maximum flow between the pair of vertices s and t selected by the algorithm, where n and m are the numbers of vertices and edges, respectively. This algorithm can be used to speed up the algorithm to compute DAGs,t that represents all minimum cuts separating vertices s and t in a graph G, and the algorithm to compute the cactus Γ(G) that represents all minimum cuts in G.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E82-A No.10 pp.2231-2236
Publication Date
1999/10/25
Publicized
Online ISSN
DOI
Type of Manuscript
PAPER
Category
Algorithms and Data Structures

Authors

Keyword