Complete problems for logspace involving lexicographic first paths in graphs

  • Iain A. Stewart
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 570)


It is shown that the problem of deciding whether a given vertex is on the lexicographic first path of some digraph, starting at some other specified vertex, is complete for deterministic logspace via projection translations: such translations are extremely weak forms of reductions. Other related problems involving constrained versions of the lexicographically first path problem in both digraphs and graphs are also shown to be similarly complete. The methods used to prove completeness involve the consideration of decision problems as sets of finite structures satisfying certain logical formulae.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AM87]
    R.ANDERSON and E.W.MAYR, Parallelism and the maximal path problem, Inform. Process. Lett. 24 (1987), 121–126.Google Scholar
  2. [BIS90]
    D.A.M.BARRINGTON, N.IMMERMAN and H.STRAUBING, On uniformity within NC 1, J. Comput. System Sci. 41 (1990), 274–306.CrossRefGoogle Scholar
  3. [CM87]
    S.A.COOK and P.MCKENZIE, Problems complete for deterministic logarithmic space, J. Algorithms 8 (1987), 385–394.Google Scholar
  4. [Coo85]
    S.A.COOK, A taxonomy of problems with fast parallel algorithms, Inform. and Control 64 (1985), 2–22.CrossRefGoogle Scholar
  5. [GHR91]
    R.GREENLAW, H.J.HOOVER and W.L.RUZZO, A compendium of problems complete for P, Part II: P-complete problems, Tech. Rep., University of Alberta, to appear.Google Scholar
  6. [GJ79]
    M.R.GAREY and D.S.JOHNSON, “Computers and Intractability: A Guide to the Theory of NP-completeness”, Freeman, San Francisco, 1979.Google Scholar
  7. [IL89]
    N.IMMERMAN and S.LANDAU, The complexity of iterated multiplication, in “Proc. 4th Symp. on Structure in Complexity Theory, 1989”, 104–111.Google Scholar
  8. [Imm87a]
    N.IMMERMAN, Languages which capture complexity classes, SIAM J. Comput. 16, No.4 (1987), 760–778.CrossRefGoogle Scholar
  9. [Imm87b]
    N.IMMERMAN, Expressibility as a complexity measure: Results and directions, in “Proc. 2nd Symp. on Structure in Complexity Theory, 1987”, 194–202.Google Scholar
  10. [Imm88]
    N.IMMERMAN, Non deterministic space is closed under complementation, SIAM J. Comput. 17, No.5 (1988), 935–938.CrossRefGoogle Scholar
  11. [Miy89]
    S.MIYANO, The lexicographically first maximal subgraph problems: P-completeness and NC algorithms, Math. Systems Theory 22, No.1 (1989), 47–73.Google Scholar
  12. [Ste91a]
    I.A.STEWART, Using the Hamiltonian path operator to capture NP, extended abstract in “Proc. 2nd International Conference on Computing and Information, 1990”, Lecture Notes in Computer Science Vol. 468, Springer-Verlag, 134-143: to appear, J. Comput. System Sci. Google Scholar
  13. [Ste91b]
    I.A.STEWART, Comparing the expressibility of languages formed using NP-complete operators, extended abstract in “Proc. 16th International Workshop on Graph Theoretic concepts in Computer Science, 1990”: J. Logic and Computation 1, No. 3 (1991), 305–330.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Iain A. Stewart
    • 1
  1. 1.Computing LaboratoryUniversity of Newcastle upon TyneNewcastle upon TyneEngland

Personalised recommendations