Skip to main content
SpringerLink
Log in

A new probabilistic model for the study of algorithmic properties of random graph problems

  • Conference paper
  • First Online:
Foundations of Computation Theory (FCT 1983)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Angluin, L.G. Valiant “Fast probabilistic algorithms for hamiltonian paths and matchings”, J. Comp. Syst. Sci, Vol. 18 (1979)

    Google Scholar 

  2. B. Bollobas “Graph theory. An Introductory course” Springer Verlag, New York (1979)

    Google Scholar 

  3. B. Bollobas, P. Erdös “Cliques in random graphs” Math. Proc. Camb. Phil. Soc., Vol. 80 (1976)

    Google Scholar 

  4. V.L. Chung “A course in probability theory” Academic Press (1974)

    Google Scholar 

  5. P. Erdös, A. Renyi “On the evolution of random graphs” Publ. Math. Inst. Hungar. Acad. Sci., Vol. 5 (1960)

    Google Scholar 

  6. M.R. Garey, D.S. Johnson “Computers and intractability. A guide o the theory of NP-completeness', Freeman, San Francisco, 1978).

    Google Scholar 

  7. G. R. Grimmett, C. J. H. Mc Diarmid “On colouring random graphs” Math. Proc. Camb. Phil. Soc. Vol 77, (1975).

    Google Scholar 

  8. R. M. Karp “The probabilistic analysis of some combinatorial search algorithms” In J. F. Tranb (ed.) “Algorithms and complexity: New directions and recent results”, Academic Press, New York (1976)

    Google Scholar 

  9. A.D. Korshunov “Solution of a problem of Erdös and Renyi on Hamiltonian cycles in nonoriented graphs” Soviet. Mat. Doklady, Vol. 17 (1976)

    Google Scholar 

  10. R.M. Karp, M. Sipser “Maximum matchings in sparse random graphs” Proc. 22th Ann. Symp. on Foundations of Computer Science, I EEE Computer Society (1981)

    Google Scholar 

  11. L. Posa “Hamiltonian circuits in random graphs” Discr. Math., Vol. 14, (1976)

    Google Scholar 

  12. C. Papadimitriou, D. Steiglitz “Combinatorial optimization. Algorithms and complexity” Prentice Hall (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Matematica, Università dell'Aquila, Via Roma 33, L'Aquila, Italy

    Marco Protasi

  2. IASI-CNR, Via Buonarroti 12, Roma, Italy

    Maurizio Talamo

Authors
  1. Marco Protasi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maurizio Talamo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpinski

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Protasi, M., Talamo, M. (1983). A new probabilistic model for the study of algorithmic properties of random graph problems. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_118

Download citation

  • DOI: https://doi.org/10.1007/3-540-12689-9_118

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38682-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation