QP-2009-03

A quick proof for the cactus representation of mincuts

Tamás Fleiner, András Frank



Abstract

A short and simple proof is given for an elegant theorem of E.A. Dinits, A.V. Karzanov and M.V. Lomonosov on representing all of the minimum cuts of an undirected graph by a cactus, a graph built up from edge-disjoint circuits in a tree-like manner.


Bibtex entry:

@techreport{egresqp-09-03,
AUTHOR = {Fleiner, Tam{\'a}s and Frank, Andr{\'a}s},
TITLE = {A quick proof for the cactus representation of mincuts},
NOTE= {{\tt www.cs.elte.hu/egres}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2009},
NUMBER = {QP-2009-03}
}


Last modification: 21.9.2017. Please email your comments to Tamás Király!