Minimum cut with the fewest number of arcs

zbMATH Open1249.90029MaRDI QIDQ2881177FDOQ2881177

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)

Cited In (1)

• On the minimum dummy-arc problem

   Recommendations

• Minimum Cuts for Circular-Arc Graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• On the Number of Minimum Cuts in a Graph 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Finding minimal branchings with a given number of arcs 👍 👎
• Graphs with the smallest number of minimum cut sets 👍 👎
• Minimum cuts in geometric intersection graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Minimum cutsets in hypercubes 👍 👎

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)