Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph-Theoretic Concepts in Computer Science

WG 1989: Graph-Theoretic Concepts in Computer Science pp 277–286Cite as

The complexity of graph problems for succinctly represented graphs

  • Graphs And Data Structures
  • Conference paper
  • First Online:

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

Abstract

Highly regular graphs can be represented advantageously by some kind of description shorter than the full adjacency matrix; a natural succinct representation is by means of a boolean circuit computing the adjacency matrix as a boolean function. The complexity of the decision problems for several graph-theoretic properties changes drastically when this succinct representation is used to present the input. We close up substantially the gaps between the known lower and upper bounds for these succinct problems, in most cases matching optimally the lower and the upper bound.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. J.L. Balcázar, J. Díaz, J. Gabarró: Structural Complexity I. EATCS Monographs on Theoretical Computer Science, vol. 11, Springer-Verlag (1988).

    Google Scholar 

  2. A. Chandra, D. Kozen, L. Stockmeyer: “Alternation”. Journal ACM 28 (1981), 114–133.

    Article  Google Scholar 

  3. A. Chandra, L. Stockmeyer, U. Vishkin: “Constant depth reducibility”. SIAM Journal on Computing 13 (1984), 423–439.

    Article  Google Scholar 

  4. H. Galperin, A. Wigderson: “Succinct representations of graphs”. Information and Control 56 (1983), 183–198.

    Article  Google Scholar 

  5. M. Garey, D. Johnson: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1978).

    Google Scholar 

  6. J. Hong: “On some deterministic space complexity problems”. SIAM Journal on Computing 11 (1982), 591–601.

    Article  Google Scholar 

  7. N. Immerman: “Nondeterministic space is closed under complementation”. SIAM Journal on Computing 17 (1988), 935–938.

    Article  Google Scholar 

  8. N.D. Jones, E. Lien, W.T. Laaser: “New problems complete for nondeterministic log space”. Mathematical Systems Theory 10 (1976), 1–17.

    Article  Google Scholar 

  9. R.E. Ladner: “The circuit value problem is log space complete for P”. SIGACT News 7 (1975), 18–20.

    Article  Google Scholar 

  10. H.R. Lewis, Ch. Papadimitriou: “Symmetric space-bounded computation”. Theoretical Computer Science 19 (1982), 161–187.

    Article  Google Scholar 

  11. A. Lozano: “NP-hardness on succinct representations of graphs”. Bulletin of the EATCS 35 (1988), 158–163.

    Google Scholar 

  12. Ch. Papadimitriou, M. Yannakakis: “A note on succinct representations of graphs”. Information and Control 71 (1986), 181–185.

    Article  Google Scholar 

  13. J.H. Reif: “Symmetric complementation”. Journal ACM 31 (1984), 401–421.

    Article  Google Scholar 

  14. S. Skyum, L.G. Valiant: “A complexity theory based on boolean algebra”. Journal ACM 32 (1985), 484–502.

    Article  Google Scholar 

  15. J. Torán: “Succinct representations of counting problems”. 6th Int. Conf. on Applied Algebra, Algebraic Algorithms, and Error Correcting Codes, Rome, Italy (1988).

    Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Software (Llenguatges i Sistemes Informàtics), Universitat Politècnica de Catalunya, 08028, Barcelona, Spain

    Antonio Lozano & José L. Balcázar

Authors
  1. Antonio Lozano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José L. Balcázar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Manfred Nagl

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lozano, A., Balcázar, J.L. (1990). The complexity of graph problems for succinctly represented graphs. In: Nagl, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 1989. Lecture Notes in Computer Science, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52292-1_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-52292-1_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52292-8

  • Online ISBN: 978-3-540-46950-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation