Alternating cycle covers and paths

  • Oliver Vornberger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 100)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Garey, D. Johnson: "Computers and Intractibility, A guide to the Theory of NP-Completeness", San Francisco 1979Google Scholar
  2. [2]
    N. Christofides: " Graph Theory, An Algorithmic Approach", Academic press, 1975Google Scholar
  3. [3]
    W. Savitch: " Relationships between nondeterministic and deterministic Tape Complexities", ICSS 4 (1970) pp. 179–192Google Scholar
  4. [4]
    B. Monien, D. Janssen: " Über die Komplexität der Fehlerdiagnose bei Systemen", ZAMM 57 (1977) pp. 315–317Google Scholar
  5. [5]
    O. Vornberger: "Komplexität von Wegeproblemen in Graphen" Bericht Nr. 5, Reihe Theoretische Informatik, FB 17 der GH PaderbornGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Oliver Vornberger
    • 1
  1. 1.Dept. of Electrical Engeneering and Computer ScienceUniversity of CaliforniaBerkeleyUSA

Personalised recommendations