Abstract
We consider problems of finding the maximum cut and a cycle covering for a planar graph with edge weights of arbitrary sign. Methods that find the maximum cut in graphs with only positive edge weights are shown to be inapplicable in this case. NP-completeness of the problem is proved.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
M. R. Garey and D. Johnson, Computers and Intractability, Freeman, San Francisco (1979).
G. I. Orlova and V. G. Dorfman, “Finding the maximum cut in graph engineering,” Cybernetics,10, 502–506 (1972).
F. Hadlock, “Finding a minimum cut of a planar graph in polynomial time,” SIAM J. Comput,4, 605–611 (1975).
D. S. Johnson, “The NP-completeness column: an ongoing guide,” J. Algor.,5, 147–160 (1984).
R. V. Pinter, “Optimal layer assignment for interconnects,” J. VLSI Comput. Syst.,1, No. 2, 123–137 (1985).
Y. Kajitani, “Order on channels for safe routing and optimal compaction of routing area,” Proc. 1983 Int. Conf. CAD IEEE, New York (1983), pp. 61–65.
M. N. S. Swamy and K. Thulasiraman, Graphs, Networks, and Algorithms, Wiley, New York (1981).
M. R. Garey, D. S. Johnson, and R. E. Tarjan, “The planar Hamiltonian circuit problem is NP-complete,” SIAM J. Comput.,5, No. 4, 704–714 (1975).
Additional information
Translated from Kibernetika, No. 1, pp. 13–16, January–February, 1991.
Rights and permissions
About this article
Cite this article
Terebenkov, A.P. NP-completeness of maximum-cut and cycle-covering problems for a planar graph. Cybern Syst Anal 27, 16–20 (1991). https://doi.org/10.1007/BF01068642
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068642