Abstract
We exhibite a polynomial algorithm which, given a cubic graph with positive weights on the edges, finds a maximal edge-cut(whose total weight may not be improved by moving a single vertex from one “side” of the cut to the other “side”).
This complements a recent result of A.A.Schäffer and M. Yannakakis that maximal cut problem is complete in the class of the local search problems.
Extended Abstract
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. S. Johnson, C. H. Papadimitriou, M. Yannakakis, How Easy Is Local Search?, (Extended Abstract) in Proc. 26th Annual Symposium on Foundations of Computer Science, 1985, pp. 39–42, also J. Comp. syst.Sci. 37(1988), pp. 79–100.
M. W. Krentel, On Finding Locally Optimal Solutions, Rice University Tech. Rept. COMP TR88-72; to appear in SIAM J. Comp.
A. A. Schäffer, M. Yannakakis, Simple Local Search Problems That Are Hard to Solve, preprint (1990).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loebl, M. (1991). Efficient maximal cubic graph cuts. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_147
Download citation
DOI: https://doi.org/10.1007/3-540-54233-7_147
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54233-9
Online ISBN: 978-3-540-47516-3
eBook Packages: Springer Book Archive