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.
Cite
CITATION STYLE
Vornberger, O. (1981). Alternating cycle covers and paths. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 100 LNCS, pp. 367–378). Springer Verlag. https://doi.org/10.1007/3-540-10291-4_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
