A Simple Algorithm for the Planar Multiway Cut Problem

Journal of Algorithms

Volumn 39, Issue 1, 2001, Pages 68-77

  Yeh, Wei Chang ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Algorithm; Cut; Multiway cut; Planar graph

Indexed keywords

EID: 0009969821     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1148     Document Type: Article

References (12)

1. E. Dalhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis, The complexity of the multiway cuts, SIAM J. Comput. 23 (1994), 864-894.
2. O. Goldschmidt, "Deterministic and Probabilistic Aspects of the k-Way Cut Problem," Ph.D. Dissertation, U.C. Berkeley, 1988.
3. O. Goldschmidt and D. S. Hochbaum, Polynomial algorithm for the k-way cut problem, in Proceedings, 29th IEEE FOCS, 1988.
4. O. Goldschmidt and D. S. Hochbaum, "A Polynomial Algorithm for the k-Way Cut Problem for Fixed k," Unpublished paper, 1991.
5. O. Goldschmidt and D. S. Hochbaum, Asymptotically optimal linear algorithm for the minimum k-way cut in a random graph, SIAM J. Discrete Math. 3 (1990), 58-73.
6. X. He, An improved algorithm for the planar 3-way cut problem, J. Algorithms 12 (1991), 23-37.
7. 2) algorithm for the planar 3-way cut problem, SIAM J. Algebraic Discrete Math. 6 (1985), 707-712.
8. D. S. Hochbaum and L. Tsai, "A Greedy Algorithm for the 3-Way Cut Problem and Its Worse Case Bound," Technical report IP-318, Economic Theory and Econometrics, U. C. Berkeley, 1983.
9. H. S. Wang, "On Minimum-Fold Cuts in Networks," Ph.D. Dissertation, University of Texas at Arlington, 1990.
10. J. Hopcroft and R. Tarjan, Algorithm 447: Efficient algorithms for graph manipulation, Comm. Assoc. Comput. Mach. 16 (1973), 327-378.
11. W. C. Yeh, M. S. Yeh, and H. W. Corley, A polynomial algorithm for the planar k-way cut problem, in "CIIE National Conference," pp. 58-63, 1992.
12. H. S. Stone, Multiprocessor scheduling with the aid of network flow algorithms, IEEE Trans. Software Engrg. 3 (1997), 85-93.