✦ LIBER ✦

Exact cuts in networks

✍ Scribed by J. Scott Provan; V. G. Kulkarni

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 455 KB
Volume: 19
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230190303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum cuts in parametric networks

✍ F. A. Sharifov 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 402 KB

Enumeration of minimal cuts of modified

Enumeration of minimal cuts of modified networks

✍ J.M. Nahman 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 170 KB

On the exact separation of mixed integer

On the exact separation of mixed integer knapsack cuts

✍ Ricardo Fukasawa; Marcos Goycoolea 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 300 KB

An exact algorithm for MAX-CUT in sparse

An exact algorithm for MAX-CUT in sparse graphs

✍ F. Della Croce; M.J. Kaminski; V.Th. Paschos 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Parametric analysis of overall min-cuts

Parametric analysis of overall min-cuts and applications in undirected networks

✍ Y.P. Aneja; R. Chandrasekaran; K.P.K. Nair 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 211 KB

The overall min-cut problem in a capacitated undirected network is well known. Recently Stoer and Wagner gave an elegant algorithm for finding such a cut. In this paper we present a parametric analysis of such a cut where the capacity of an arc {i, j } in the network is given by min{b ij , λ}, where

All-Pairs Min-Cut in Sparse Networks

✍ Srinivasa R Arikati; Shiva Chaudhuri; Christos D Zaroliagis 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 355 KB

Algorithms are presented for the all-pairs min-cut problem in bounded treewidth, planar, and sparse networks. The approach used is to preprocess the input n-vertex network so that afterward, the value of a min-cut between any two vertices can be efficiently computed. A tradeoff is shown between the