Efficiently covering complex networks with cliques of similar vertices

Theoretical Computer Science

Volumn 355, Issue 1, 2006, Pages 37-47

  Behrisch, Michael ^a   Taraz, Anusch ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Clique cover algorithm; Intersection graphs; Random graphs

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; POLYNOMIALS;

CLIQUE COVER ALGORITHM; INTERSECTION GRAPHS; RANDOM GRAPHS;

LARGE SCALE SYSTEMS;

EID: 33644858199     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.12.005     Document Type: Article

References (16)

1. R. Albert, H. Jeong, A.-L. Barabási, Database of self-organized networks, 〈 http://www.nd.edu/ ~ networks/database/index.html 〉.
2. M. Behrisch, Component evolution in random intersection graphs, November 2004, preprint.
3. J.A. Fill, E.R. Scheinerman, and K.B. Singer-Cohen 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 2000 156 176
4. C. Frömmel, C. Gille, A. Goede, C. Gröpl, R. Preissner, S. Hougardy, T. Nierhoff, and M. Thimm Accelerating screening of 3D protein data with a graph theoretical approach Bioinformatics 19 18 2003 2442 2447
5. M.R. Garey, and D.S. Johnson Computers and Intractability 1979 W.H. Freeman and Company New York
6. E. Godehardt, J. Jaworski, Two models of random intersection graphs and their applications, Electronic Notes in Discrete Mathematics, Vol. 10, URL: 〈 http://www1.elsevier.com/gej-ng/31/29/24/49/27/61/endm10036.ps 〉.
7. A. Goede, R. Preissner, S. Hougardy, and M. Thimm Comparison of 2D similarity and 3D superposition. application to searching a conformational drug database J. Chem. Inform. Comput. Sci. 44 2004 1816 1822
8. R. Govindan, H. Tangmunarunkit, SCAN + Lucent internet map from the ISI, 〈 http://www.isi.edu/div7/scan/mercator/maps.html 〉, November 1999.
9. J.-L. Guillaume, and M. Latapy Bipartite structure of all complex networks Inform. Process. Lett. 90 2004 215 221
10. S. Janson, T. Łuczak, and A. Ruciński Random Graphs 2000 Wiley New York
11. M. Karoński, E.R. Scheinerman, and K.B. Singer-Cohen On random intersection graphs: the subgraph problem Combinatorics, Probab. Comput. 8 1999 131 159
12. M.E.J. Newman, S.H. Strogatz, D.J. Watts, Random graphs with arbitrary degree distributions and their applications, Phys. Rev. E 64, URL: 〈 http://aps.arxiv.org/abs/cond-mat/0007235/ 〉.
13. E.R. Scheinerman Random interval graphs Combinatorica 8 4 1988 357 371
14. K.B. Singer, Random intersection graphs, Ph.D. Thesis, John Hopkins University, Baltimore, MA, 1995.
15. D. Stark The vertex degree distribution of random intersection graphs Random Struct. Algorithms 24 3 2004 249 258
16. M. Behrisch, A. Taraz, M. Ueckerdt, Colouring random intersection graphs and complex networks, December 2005, preprint.