QP-2009-05

Computing the minimum cut in hypergraphic matroids

Tamás Király



Abstract

Hypergraphic matroids were defined by Lorea as generalizations of graphic matroids. We show that the minimum cut (co-girth) of a multiple of a hypergraphic matroid can be computed in polynomial time.


Bibtex entry:

@techreport{egresqp-09-05,
AUTHOR = {Kir{\'a}ly, Tam{\'a}s},
TITLE = {Computing the minimum cut in hypergraphic matroids},
NOTE= {{\tt www.cs.elte.hu/egres}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2009},
NUMBER = {QP-2009-05}
}


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