Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
| Autor: | Fleischer, Lisa ††E-mail: lisa@ieor.columbia.edu. Department of Industrial Engineering and Operations Research, Columbia University. Supported in part by ONR through an NDSEG fellowship, by AASERT through Grant N00014-95-1-0985, by an American Association of University Women Educational Foundation Selected Professions Fellowship, by the NSF PYI award of Éva Tardos, and by NSF through Grant DMS 9505155. |
|---|---|
| Zdroj: | In Journal of Algorithms October 1999 33(1):51-72 |
| Databáze: | ScienceDirect |
| Externí odkaz: |
|
Full Text from ScienceDirect