✦ LIBER ✦

A Multiterminal Minimum Cut Algorithm for Planar Graphs

✍ Scribed by Shiloach, Yossi

Book ID: 118174058
Publisher: Society for Industrial and Applied Mathematics
Year: 1980
Tongue: English
Weight: 628 KB
Volume: 9
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0209020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Revisiting a simple algorithm for the pl

Revisiting a simple algorithm for the planar multiterminal cut problem

✍ Kevin K.H. Cheung; Kyle Harvey 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 315 KB

A fast algorithm for minimum weight odd

A fast algorithm for minimum weight odd circuits and cuts in planar graphs

✍ Adam N. Letchford; Nicholas A. Pearson 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 157 KB

Unifying maximum cut and minimum cut of

Unifying maximum cut and minimum cut of a planar graph

✍ Wei-Kuan Shih; Sun Wu; Kuo, Y.S. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 438 KB

Solving minimum K-cardinality cut proble

Solving minimum K-cardinality cut problems in planar graphs

✍ Maurizio Bruglieri; Francesco Maffioli; Marco Trubian 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 291 KB

How to draw the minimum cuts of a planar

How to draw the minimum cuts of a planar graph

✍ Ulrik Brandes; Sabine Cornelsen; Christian Fieß; Dorothea Wagner 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 321 KB

A Faster Algorithm for Finding the Minim

A Faster Algorithm for Finding the Minimum Cut in a Directed Graph

✍ J.X. Hao; J.B. Orlin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 995 KB

We consider the problem of finding the minimum capacity cut in a directed network \(G\) with \(n\) nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum