✦ LIBER ✦

An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem

✍ Scribed by Hochbaum, Dorit S.; Shmoys, David B.

Book ID: 118212489
Publisher: Society for Industrial and Applied Mathematics
Year: 1985
Weight: 676 KB
Volume: 6
Category: Article
ISSN: 0196-5212
DOI: 10.1137/0606068

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved algorithm for the planar 3-c

An improved algorithm for the planar 3-cut problem

✍ Xin He 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 838 KB

A Simple Algorithm for the Planar Multiw

A Simple Algorithm for the Planar Multiway Cut Problem

✍ Wei-Chang Yeh 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 95 KB

The traditional min-cut problem involves finding a cut with minimum weight between two specified vertices. The planar multiway cut problem is a NP-hard generalization of the min-cut problem. It involves separating a weighted planar graph with k specified vertices into k components such that the tota

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

An O(EVIog2V) algorithm for the maximal

An O(EVIog2V) algorithm for the maximal flow problem

✍ Zvi Galil; Amnon Naamad 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 934 KB

An efficient algorithm for the minimum c

An efficient algorithm for the minimum capacity cut problem

✍ M. Padberg; G. Rinaldi 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 757 KB

An algorithm for the planar three-index

An algorithm for the planar three-index assignment problem

✍ D. Magos; P. Miliotis 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 743 KB