Skip to main content
SpringerLink
Log in
Book cover

Latin American Symposium on Theoretical Informatics

LATIN 1992: LATIN '92 pp 177–190Cite as

On the number of components of a recursive graph

  • Conference paper
  • First Online:

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

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.

References

  1. D. R. Bean, Effective Coloration, J. of Symbolic Logic, 1976, 41, pp. 469–480.

    Google Scholar 

  2. R. J. Beigel, Unbounded Searching Algorithms, SIAM J. Computing, 1990, vol. 19, no. 3, pp. 522–537.

    Google Scholar 

  3. R. J. Beigel and W. I. Gasarch, On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case, Annals of Pure and Applied Logic, 1989, 45, pp. 1–38.

    Google Scholar 

  4. R. J. Beigel and W. I. Gasarch, On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case, Annals of Pure and Applied Logic, 1989, 45, pp. 227–246.

    Google Scholar 

  5. R. J. Beigel and W. I. Gasarch and J. T. Gill and J. Owings, Terse, Superterse, and Verbose Sets, Technical Report no. 1806, U. of Maryland at College Park, Dept. of Computer Science, 1987, Accepted to appear in Information and Computation.

    Google Scholar 

  6. J. L. Bentley and A. C. C. Yao, An Almost Optimal Algorithm for Unbounded Searching, Information Processing Letters, August, 1976, 5, pp. 82–87.

    Google Scholar 

  7. R. G. Gallagher, Information Theory and Reliable Communication, 1968, John Wiley, Ney York.

    Google Scholar 

  8. David Harel, Hamiltonian Paths in Infinite Graphs, Proc. of the 23rd Annual Symposium on Theory of Computation, 1991, pp. 220–229.

    Google Scholar 

  9. D. E. Knuth, Supernatural Numbers, in The Mathematical Gardner, D. A. Klarner, editor, 1981, pp. 310–325, Wadsworth International, publisher, Belmont, CA.

    Google Scholar 

  10. Martin Kummer, A Proof of Beigel's Cardinality Conjecture, Universität Karlsruhe, Fakultät für Informatik, 1991, 5, Postfach 6980, D-7500 Kaisruhe 1, FRG. To appear in the Journal of Symbolic Logic.

    Google Scholar 

  11. A. Manaster and J. Rosenstein, Effective Matchmaking and k-chromatic graphs, Proc. of the American Mathematical Society, 1973, 39, pp. 371–378.

    Google Scholar 

  12. H. Rogers Jr., Theory of Recursive Functions and Effective Computability, 1967, McGraw-Hill, New York.

    Google Scholar 

  13. R. I. Soare, Recursively Enumerable Sets and Degrees, Omega Series, 1987, Springer, Berlin.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Maryland, 20742, College Park, MD, USA

    William I. Gasarch & Katia S. Guimarães

  2. Institute for Advanced Computer Studies, University of Maryland, 20742, College Park, MD, USA

    William I. Gasarch

Authors
  1. William I. Gasarch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Katia S. Guimarães
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Imre Simon

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gasarch, W.I., Guimarães, K.S. (1992). On the number of components of a recursive graph. In: Simon, I. (eds) LATIN '92. LATIN 1992. Lecture Notes in Computer Science, vol 583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023828

Download citation

  • DOI: https://doi.org/10.1007/BFb0023828

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55284-0

  • Online ISBN: 978-3-540-47012-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation