𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum cuts in parametric networks

✍ Scribed by F. A. Sharifov

Publisher
Springer US
Year
1994
Tongue
English
Weight
402 KB
Volume
30
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parametric min-cuts analysis in a networ
Parametric min-cuts analysis in a network
✍ Y.P Aneja; R Chandrasekaran; K.P.K Nair πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 131 KB

The all pairs minimum cuts problem in a capacitated undirected network is well known. Gomory and Hu showed that the all pairs minimum cuts are revealed by a min-cut tree that can be obtained by solving exactly (n -1) maximum ow problems, where n is the number of nodes in the network. In this paper

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

Minimum multiway cuts in trees
Minimum multiway cuts in trees
✍ PΓ©ter L. ErdΕ‘s; AndrΓ‘s Frank; LΓ‘szlΓ³ SzΓ©kely πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 667 KB

We compare three lower bounds for the minimum cardinality of a multiway cut in a graph separating a given set S of terminals. The main result is a relatively short algorithmic proof for a simplified version of a min-max theorem of the first and the third authors asserting that the best of the three

Exact cuts in networks
Exact cuts in networks
✍ J. Scott Provan; V. G. Kulkarni πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 455 KB