✦ LIBER ✦

Fully-Dynamic Min-Cut*

✍ Scribed by Mikkel Thorup

Book ID: 106167621
Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 476 KB
Volume: 27
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-007-0045-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum replication min-cut partitioning

✍ Wai-Kei Mak; Wong, D.F. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 229 KB

Optimal min-area min-cut replication in

Optimal min-area min-cut replication in partitioned circuits

✍ Yang, H.H.; Wong, D.F. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 357 KB

Complexity of the min–max (regret) versi

Complexity of the min–max (regret) versions of min cut problems

✍ Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 254 KB

A Simple and Fast Min-Cut Algorithm

✍ Michael Brinkmeier 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 488 KB

Recognizing max-flow min-cut path matric

Recognizing max-flow min-cut path matrices

✍ David B Hartvigsen; Donald K Wagner 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 677 KB

Generalizing the all-pairs min cut probl

Generalizing the all-pairs min cut problem

✍ David Hartvigsen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1017 KB

The all-pairs min cut (APMC) problem on a nonnegative edge-weighted graph is to find, for each pair of nodes, a min cut that separates the pair. Gomory and Hu (1961) presented a structural characterization of collections of cuts that solve the APMC problem. We show how the APMC problem can be genera