The existence and efficient construction of large independent sets in general random intersection graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3142, Issue , 2004, Pages 1029-1040

  Nikoletseas, S ^a,b   Raptopoulos, C ^a,b   Spirakis, P ^a,b  

^a University of Patras and Computer Technology Institute   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; GRAPHIC METHODS;

ALGORITHMIC CONSTRUCTION; EFFICIENT CONSTRUCTION; GRAPH PARAMETERS; INDEPENDENT SET; INTERSECTION GRAPH; RANDOM INTERSECTION GRAPHS; RANDOM MODEL; RANDOM REGULAR GRAPH;

ALGORITHMS;

EID: 35048835327     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_86     Document Type: Article

References (15)

1. N. Alon and J.H. Spencer, "The Probabilistic Method", Second Edition, John Wiley & Sons, Inc, 2000.
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela and M. Protasi, "Complexity and Approximation", Springer-Verlag Berlin Heidelberg, 1999.
3. B. Bollobás, "Random Graphs", Second Edition, Cambridge University Press, 2001.
4. J. Díaz, M.D. Penrose, J. Petit and M. Serna, "Approximating Layout Problems on Random Geometric Graphs", Journal of Algorithms, 39:78-116, 2001.
5. J. Díaz, J.Petit and M. Serna, Chapter titled "A Guide to Concentration Bounds", in the "Handbook of Randomized Computing - Volumes I & II (Combinatorial Optimization 9)", pp.457-507, Kluwer Academic Publishers, Volume I, 2001.
6. J. Díaz, J. Petit and M. Serna, "A Random Graph Model for Optical Networks of Sensors", in the 1st International Workshop on Efficient and Experimental Algorithms, (WEA), 2003. Also in the IEEE Transactions on Mobile Computing Journal, 2(3):186-196, 2003.
7. 2", in J. Rolim, M. Luby and M. Serna, editors, Randomization and Approximation Techniques in Computer Science, volume 1518 of Lecture Notes in Computer Science, pages 294-306, Springer Verlag, Berlin, 1998.
8. J.A. Fill, E.R. Sheinerman and K.B Singer-Cohen, "Random Intersection Graphs when m = w(n): An Equivalence Theorem Relating the Evolution of the G(n,m,p) and G(n,p) models", http://citeseer.nj.nec.com/ fill98random.html
9. E. Godehardt and J. Jaworski, "Two models of Random Intersection Graphs for Classification", Studies in Classification, Data Analysis and Knowledge Organisation, Opitz O., Schwaiger M, (Eds), Springer Verlag, Berlin, Heidelberg, New York (2002), 67-82.
10. M. Karonski, E.R. Scheinerman and K.B. Singer- Cohen, "On Random Intersection Graphs: The Subgraph Problem", Combinatorics, Probability and Computing journal (1999) 8, 131-159.
11. E. Marczewski, "Sur deux propriétés des classes d' ensembles", Fund. Math. 33, 303-307 (1945).
12. S. Nikoletseas, C. Raptopoulos and P. Spirakis, "The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs", http://www.cti.gr/RD1/nikole/english/psfiles/paper.ps.
13. M. Penrose, "Random Geometric Graphs", Oxford Studies in Probability, 2003.
14. S.M. Ross, "Stochastic Processes", Second Edition, John Wiley & Sons, Inc., 1996.
15. K.B. Singer-Cohen, "Random Intersection Graphs", PhD thesis, John Hopkins University, 1995.