Abstract
The boundary between the class P (problems solvable in polynomial time) and the class of NP-complete problems (probably not solvable in polynomial time) is investigated in the area of alternating cycle covers and alternating paths. By means of logarithm space reductions it is shown, that the transition from undirected graphs to directed graphs causes a jump from polynomial time to NP-Completeness.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Literature
M. Garey, D. Johnson: "Computers and Intractibility, A guide to the Theory of NP-Completeness", San Francisco 1979
N. Christofides: " Graph Theory, An Algorithmic Approach", Academic press, 1975
W. Savitch: " Relationships between nondeterministic and deterministic Tape Complexities", ICSS 4 (1970) pp. 179–192
B. Monien, D. Janssen: " Über die Komplexität der Fehlerdiagnose bei Systemen", ZAMM 57 (1977) pp. 315–317
O. Vornberger: "Komplexität von Wegeproblemen in Graphen" Bericht Nr. 5, Reihe Theoretische Informatik, FB 17 der GH Paderborn
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vornberger, O. (1981). Alternating cycle covers and paths. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_27
Download citation
DOI: https://doi.org/10.1007/3-540-10291-4_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10291-5
Online ISBN: 978-3-540-38435-9
eBook Packages: Springer Book Archive