✦ LIBER ✦

Metrics and undirected cuts

✍ Scribed by A. V. Karzanov

Book ID: 105250364
Publisher: Springer-Verlag
Year: 1985
Tongue: English
Weight: 844 KB
Volume: 32
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01586090

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing cuts in undirected graphs

✍ Alberto Caprara; Alessandro Panconesi; Romeo Rizzi 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

Geometry of Cuts and Metrics

✍ Michel Marie Deza, Monique Laurent (auth.) 📂 Library 📅 1997 🏛 Springer 🌐 English ⚖ 2 MB

Cuts and metrics are well-known objects that arise - independently, but with many deep and fascinating connections - in diverse fields: in graph theory, combinatorial optimization, geometry of numbers, distance geometry, combinatorial matrix theory, statistical physics, VLSI design etc. A main featu

Sums of Cuts and Bipartite Metrics

✍ Karzanov, A.V. 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 778 KB

Computing All Small Cuts in an Undirecte

Computing All Small Cuts in an Undirected Network

✍ Nagamochi, Hiroshi; Nishimura, Kazuhiro; Ibaraki, Toshihide 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 321 KB

Counting the number of minimum cuts in u

Counting the number of minimum cuts in undirected multigraphs

✍ Nagamochi, H.; Sun, Z.; Ibaraki, T. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 454 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