On minimal cuts of recursively generated hypergraphs

MaRDI QIDQ3059622zbMATHFDO

Authors V. V. Lepin

Publication date 25 November 2010

zbMATH Keywords

algorithmrooted treedecomposition treeterminalminimum size of a cutrecursively generated hypergraph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Connectivity (05C40) Hypergraphs (05C65)

Recommendations

• Computing minimum multiway cuts in hypergraphs
• Finding minimum 3-way cuts in hypergraphs
• Algorithms for the determination of cutsets in a hypergraph
• Minimum cut and minimum \(k\)-cut in hypergraphs via branching contractions
• Finding Minimum 3-Way Cuts in Hypergraphs

Cited in

(4)

• On constructing the minimal realizations of hypergraphs
• Counting and sampling minimum cuts in genus g graphs
• An algorithm for finding the independence number of a recursively generated hypergraph
• Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions

This page was built for publication: On minimal cuts of recursively generated hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059622)