𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the structure of all minimum cuts in a network and applications

✍ Scribed by Jean-Claude Picard; Maurice Queyranne

Publisher
Springer-Verlag
Year
1982
Tongue
English
Weight
16 KB
Volume
22
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Building Chain and Cactus Representation
Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
✍ Lisa Fleischer πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 214 KB

A cactus is a simple data structure that represents all minimum cuts of a weighted, undirected graph in linear space. We describe the first algorithm that can build a cactus from the asymptotically fastest deterministic algorithm that finds all minimum cuts in a weighted graphᎏthe Hao᎐Orlin minimum