Minimum cut with the fewest number of arcs

MaRDI QIDQ2881177zbMATH OpenFDO

Authors Laura Ciupală

Publication date 3 April 2012

Published in Bulletin of the Transilvania University of Brașov. Series III. Mathematics, Informatics, Physics (Search for Journal in Brave)

zbMATH Keywords

network flowmaximum flowminimum cut

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10)

Recommendations

• Minimum Cuts for Circular-Arc Graphs
• scientific article; zbMATH DE number 3891429
• On the Number of Minimum Cuts in a Graph
• scientific article; zbMATH DE number 2089977
• scientific article; zbMATH DE number 1256719
• Finding minimal branchings with a given number of arcs
• Graphs with the smallest number of minimum cut sets
• Minimum cuts in geometric intersection graphs
• scientific article; zbMATH DE number 177539
• Minimum cutsets in hypercubes

Cited in

(1)

• On the minimum dummy-arc problem

This page was built for publication: Minimum cut with the fewest number of arcs

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