Skip to main content
SpringerLink
Log in

Independent Sets in Random Intersection Graphs

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 125 Accesses

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Alon N, Spencer H (2000) The probabilistic method. Wiley

    Book  MATH  Google Scholar 

  2. Efthymiou C, Spirakis P (2005) On the existence of Hamiltonian cycles in random intersection graphs. In: Proceedings of 32nd international colloquium on automata, languages and programming (ICALP). Springer, Berlin/Heidelberg, pp 690–701

    Google Scholar 

  3. Fill JA, Sheinerman ER, Singer-Cohen KB (2000) Random intersection graphs when m = ω(n): an equivalence theorem relating the evolution of the g(n, m, p) and g(n, p)models. Random Struct Algorithms 16(2):156–176

    Article  MathSciNet  MATH  Google Scholar 

  4. Karoński M, Scheinerman ER, Singer-Cohen KB (1999) On random intersection graphs: the subgraph problem. Adv Appl Math 8:131–159

    MathSciNet  MATH  Google Scholar 

  5. Marczewski E (1945) Sur deux propriétés des classes d’ensembles. Fundam Math 33:303–307

    MATH  Google Scholar 

  6. Motwani R, Raghavan P (1995) Randomized algorithms. Cambridge University Press

    Book  MATH  Google Scholar 

  7. Nikoletseas S, Raptopoulos C, Spirakis P (2004) The existence and efficient construction of large independent sets in general random intersection graphs. In: Proceedings of 31st international colloquium on Automata, Languages and Programming (ICALP). Springer, Berlin/Heidelberg, pp 1029–1040. Also in the Theoretical Computer Science (TCS) Journal, accepted, to appear in 2008

    Google Scholar 

  8. Raptopoulos C, Spirakis P (2005) Simple and efficient greedy algorithms for Hamiltonian cycles in random intersection graphs. In: Proceedings of the 16th international symposium on algorithms and computation (ISAAC). Springer, Berlin/Heidelberg, pp 493–504

    Google Scholar 

  9. Ross S (1995) Stochastic processes. Wiley

    Google Scholar 

  10. Singer-Cohen KB (1995) Random intersection graphs. Ph.D. thesis, John Hopkins University, Baltimore

    Google Scholar 

  11. Stark D (2004) The vertex degree distribution of random intersection graphs. Random Struct Algorithms 24:249–258

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering and Informatics Department, University of Patras, Patras, Greece

    Sotiris Nikoletseas

  2. Computer Science Department, University of Geneva, Geneva, Switzerland

    Christoforos L. Raptopoulos

  3. Computer Technology Institute and Press “Diophantus”, Patras, Greece

    Sotiris Nikoletseas & Christoforos L. Raptopoulos

  4. Research Academic Computer Technology Institute, Greece and Computer Engineering and Informatics Department, University of Patras, Patras, Greece

    Christoforos L. Raptopoulos

  5. Computer Engineering and Informatics, Research and Academic Computer Technology Institute, Patras University, Patras, Greece

    Paul (Pavlos) Spirakis

  6. Computer Science, University of Liverpool, Liverpool, UK

    Paul (Pavlos) Spirakis

  7. Computer Technology Institute (CTI), Patras, Greece

    Paul (Pavlos) Spirakis

Authors
  1. Sotiris Nikoletseas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christoforos L. Raptopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paul (Pavlos) Spirakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sotiris Nikoletseas .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Nikoletseas, S., Raptopoulos, C.L., Spirakis, P.(. (2016). Independent Sets in Random Intersection Graphs. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_187

Download citation

Publish with us

Policies and ethics

Search

Navigation