Minimum cut with the fewest number of arcs

Authors

  • Laura Ciupala Transilvania University of Brasov, Romania

Keywords:

network flow, minimum cut, maximum flow

Abstract

In this paper, we focus on determining among all minimum cuts in a given network, a minimum cut containing the smallest number of arcs. We will solve this problem by reducing it to a standard minimum cut problem in a transformed network.

Author Biography

Laura Ciupala, Transilvania University of Brasov, Romania

Faculty of Mathematics and Informatics

Downloads

Published

2012-01-10

Issue

Vol. 4(53) No. 2 (2011)

Section

INFORMATICS