Skip to main content
SpringerLink
Log in

A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number

  • Conference paper
STACS 2004 (STACS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2996))

Included in the following conference series:

  • 661 Accesses

Abstract

How difficult is it to find a path between two vertices in finite directed graphs whose independence number is bounded by some constant k? The independence number of a graph is the largest number of vertices that can be picked such that there is no edge between any two of them. The complexity of this problem depends on the exact question we ask: Do we only wish to tell whether a path exists? Do we also wish to construct such a path? Are we required to construct the shortest path? Concerning the first question, it is known that the reachability problem is first-order definable for all k. In contrast, the corresponding reachability problems for many other types of finite graphs, including dags and trees, are not first-order definable. Concerning the second question, in this paper it is shown that not only can we construct paths in logarithmic space, but there even exists a logspace approximation scheme for this problem. It gets an additional input r>1 and outputs a path that is at most r times as long as the shortest path. In contrast, for directed graphs, undirected graphs, and dags we cannot construct paths in logarithmic space (let alone approximate the shortest one), unless complexity class collapses occur. Concerning the third question, it is shown that even telling whether the shortest path has a certain length is NL-complete and thus as difficult as for arbitrary directed graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ajtai, M.: \(\Sigma^{1}_{1}\) formulae on finite structures. Annals of Pure and Applied Logic 24, 1–48 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chandra, A., Stockmeyer, L., Vishkin, U.: Constant depth reducibilities. SIAM J. Comput. 13(2), 423–439 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cook, S.: A taxonomy of problems with fast parallel algorithms. Inform. Control 64(1-3), 2–22 (1985)

    Article  MATH  Google Scholar 

  4. Cook, S., McKenzie, P.: Problems complete for deterministic logarithmic space. J. Algorithms 8(3), 385–394 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  5. Faudree, R., Gould, R., Lesniak, L., Lindquester, T.: Generalized degree conditions for graphs with bounded independence number. J. Graph Theory 19(3), 397–409 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Furst, M., Saxe, J., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Math. Systems Theory 17(1), 13–27 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  7. Galperin, H., Wigderson, A.: Succinct representations of graphs. Inform. Control 56(3), 183–198 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gottlob, G., Leone, N., Veith, H.: Succinctness as a source of complexity in logical formalisms. Annals of Pure and Applied Logic 97, 231–260 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hemaspaandra, L., Torenvliet, L.: Optimal advice. Theoretical Comput. Sci. 154(2), 367–377 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  10. Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1998)

    Google Scholar 

  11. Jones, N.: Space-bounded reducibility among combinatorial problems. J. Comput. Syst. Sci. 11(1), 68–85 (1975)

    Article  MATH  Google Scholar 

  12. Jones, N., Lien, Y., Laaser, W.: New problems complete for nondeterministic log space. Math. Systems Theory 10, 1–17 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  13. Landau, H.: On dominance relations and the structure of animal societies, III: The condition for secure structure. Bull. Mathematical Biophysics 15(2), 143–148 (1953)

    Article  Google Scholar 

  14. Lewis, H., Papadimitriou, C.: Symmetric space-bounded computation. Theoretical Comput. Sci. 19(2), 161–187 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  15. Lindell, S.: A purely logical characterization of circuit uniformity. In: Proc. 7th Struc. in Complexity Theory Conf., pp. 185–192. IEEE Computer Society Press, Los Alamitos (1992)

    Google Scholar 

  16. Megiddo, N., Vishkin, U.: On finding a minimum dominating set in a tournament. Theoretical Comput. Sci. 61, 307–316 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  17. Moon, J.: Topics on Tournaments. Holt, Rinehart, and Winston (1968)

    Google Scholar 

  18. Nickelsen, A., Tantau, T.: On reachability in graphs with bounded independence number. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 554–563. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Papadimitriou, C., Yannakakis, M.: A note on succinct representations of graphs. Inform. Control 71(3), 181–185 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  20. Reid, K., Beineke, L.: Tournaments. In: Selected Topics in Graph Theory, pp. 169–204. Academic Press, London (1978)

    Google Scholar 

  21. Savitch, W.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177–192 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  22. Tantau, T.: Logspace optimisation problems and their approximation properties. Technical report TR03-077, Electronic Colloquium on Computational Complexity (2003)

    Google Scholar 

  23. Wagner, K.: The complexity of problems concerning graphs with regularities. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984. LNCS, vol. 176, pp. 544–552. Springer, Heidelberg (1984)

    Chapter  Google Scholar 

  24. Wagner, K.: The complexity of combinatorial problems with succinct input representation. Acta Informatica 23(3), 325–356 (1986)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International Computer Science Institute, 1947 Center Street, Berkeley, CA, 94704, USA

    Till Tantau

Authors
  1. Till Tantau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Stuttgart, FMI, Germany

    Volker Diekert

  2. LIAFA and the University of Paris 7, Denis Diderot,  

    Michel Habib

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tantau, T. (2004). A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24749-4_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21236-2

  • Online ISBN: 978-3-540-24749-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation