A simple min-cut algorithm
Work
Year: 1997
Type: article
Abstract: We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implement, and has a surpris... more
Source: Journal of the ACM
Authors Mechthild Stoer, Frank Olaf Wagner
Institution Freie Universität Berlin
Cites: 16
Cited by: 721
Related to: 10
FWCI: 4.892
Citation percentile (by year/subfield): 98.81
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze