Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 2001: Algorithms and Computation pp 525–537Cite as

Go with the Winners Algorithms for Cliques in Random Graphs

  • Conference paper
  • First Online:

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

Abstract

This paper analyzes the performance of the Go with the Winners algorithm (GWTW) of Aldous and Vazirani [1] on random instances of the clique problem. In particular, we consider the uniform distribution on the set of all graphs with n ∈ IN vertices. We prove a lower bound of nω(log n) and a matching upper bound on the time needed by GWTW to find a clique of size (1 + ∈) log n (for any constant ∈ > 0). We extend the lower bound result to other distributions, under which graphs are guaranteed to have large cliques.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Aldous and U. Vazirani. “Go with the winners” algorithms. In Proceedings 35th IEEE Symposium on the Foundations of Computer Science, pages 492–501. IEEE Computer Society Press, 1994.

    Google Scholar 

  2. N. Alon, M. Krivelevich, and B. Sudakov. Finding a large hidden clique in a random graph. Random Structures and Algorithms, 13:457–466, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  3. N. Alon and J. Spencer. The Probabilistic Method. Wiley, 1992.

    Google Scholar 

  4. B. Bollobás. Random Graphs. Academic Press, 1985.

    Google Scholar 

  5. B. Bollobás and P. Erdös. Cliques in random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, 80:419–427, 1976.

    Google Scholar 

  6. R. Boppana and M. M. Halldórsson. Approximating maximum independent sets by excluding subgraphs. BIT, 32:180–196, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  7. T. Dimitriou and R. Impagliazzo. Towards an analysis of local optimization algorithms. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pages 304–313. ACM Press, 1996.

    Google Scholar 

  8. T. Dimitriou and R. Impagliazzo. Go with the winners for graph bisection. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms SODA), pages 510–520, San Francisco, California, January 1998. SIAM.

    Google Scholar 

  9. L. Engebretsen and J. Holmerin. Clique is hard to approximate within n1-o(1). In Proceedings of the 27th International Colloquium on Automata, Languages, and Programming (ICALP), pages 2–12. Springer-Verlag, 2000.

    Google Scholar 

  10. U. Feige and R. Krauthgamer. Finding and certifying a large hidden clique in a semirandom graph. Random Structures and Algorithms, 16:195–208, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  11. G. R. Grimmett and C. J. H. McDiarmid. On coloring random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, 77:313–324, 1975.

    Google Scholar 

  12. M. Jerrum. Large cliques elude the Metropolis process. Random Structures and Algorithms, 3(4):347–360, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  13. D. S. Johnson and M. Trick, editors. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. American Mathematical Society, 1996. DIMACS Series in Discrete Mathematics and Theoretical Computer Science.

    Google Scholar 

  14. A. Juels and M. Peinado. Hiding cliques for cryptographic security. Designs, Codes and Cryptography, 20(3):269–280, July 2000.

    Article  MathSciNet  MATH  Google Scholar 

  15. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85–103. Plenum Press, 1972. 525

    Google Scholar 

  16. R. M. Karp. Probabilistic analysis of some combinatorial search problems. In J. F. Traub, editor, Algorithms and Complexity: New Directions and Recent Results. Academic Press, 1976. 526

    Google Scholar 

  17. M. Krivelevich and V. Vu. Approximating the independence number and chromatic number in expected polynomial time. In Proceedings of the 27th International Colloquium on Automata, Languages, and Programming (ICALP), pages 13–24. Springer-Verlag, 2000.

    Google Scholar 

  18. D. Matula. The largest clique size in a random graph. Technical Report CS 7608, Southern Methodist University, 1976.

    Google Scholar 

  19. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.

    Google Scholar 

  20. M. Peinado. Improved lower bounds for the randomized Boppana-Halldórsson algorithm for MAXCLIQUE. In Proceedings of the First Annual Computing and Combinatorics Conference, pages 549–558. Springer-Verlag, 1995.

    Google Scholar 

  21. M. Peinado. Go with the winners algorithms for cliques in random graphs. http://cs-people.bu.edu/mpe/publications.html, 2001.

  22. M. Peinado and T. Lengauer. ‘Go with the winners’ generators with applications to molecular modeling. In J. Rolim, editor, Proceedings of the 1st International Workshop on Randomization and Approximation Techniques in Computer Science, pages 135–149. Springer-Verlag, 1997. Lecture Notes in Computer Science 1269.

    Google Scholar 

  23. M. Peinado and T. Lengauer. Parallel ‘Go with the winners’ algorithms on the LogP model. In Proceedings of the 11th International Parallel Processing Symposium, pages 656–664, Los Alamitos, California, 1997. IEEE Computer Society Press.

    Google Scholar 

  24. J. Håstad. Clique is hard to approximate within n1-∈. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 627–636. IEEE Computer Society Press, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft, Redmond, 98052, WA, USA

    Marcus Peinado

Authors
  1. Marcus Peinado
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Basser Department of Computer Science, University of Sydney, Madsen Building F09, 2006, Sydney, NSW, Australia

    Peter Eades

  2. Department of Computer Science, University of Canterbury, Private Bag 4800, Christchurch, New Zealand

    Tadao Takaoka

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peinado, M. (2001). Go with the Winners Algorithms for Cliques in Random Graphs. In: Eades, P., Takaoka, T. (eds) Algorithms and Computation. ISAAC 2001. Lecture Notes in Computer Science, vol 2223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45678-3_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-45678-3_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation