A deterministic near-linear time algorithm for finding minimum cuts in planar graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 821-822

  Chalermsook, Parinya ^a   Fakcharoenphol, Jittat ^a   Nanongkai, Danupon ^a  

^a KASETSART UNIVERSITY   (Thailand)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY;

PLANAR GRAPHS; SHORTEST PATHS;

TREES (MATHEMATICS);

EID: 1842434569     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Noga Alon, Raphael Yuster, and Uri Zwick. Color-coding. Journal of the ACM (JACM), 42(4):844-856, 1995.
2. Monika R. Henzinger, Philip N. Klein, Satish Rao, and Sairam Subramanian. Faster Shortest-Path Algorithms for Planar Graphs. Journal of Computer and System Sciences, 55(1):3-23, 1997.
3. David R. Karger. Minimum cuts in near-linear time. Journal of the ACM (JACM), 47(1):46-76, 2000.
4. David R. Karger and Cliord Stein. A new approach to the minimum cut problem. Journal of the ACM, 43(4):601-640, 1996.
5. Richard J. Lipton and Robert E. Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36:177-189, 1979.
6. Karsten Weihe. Maximum (s, t)- ows in planar networks in O(|V| log |V|)-time. Journal of Computer and System Sciences, 55(3):454-476, 1997.