Bipartite graphs as models of complex networks

Lecture Notes in Computer Science

Volumn 3405, Issue , 2005, Pages 127-139

  Guillaume, Jean Loup ^a   Latapy, Matthieu ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; RANDOM PROCESSES;

BIPARTITE GRAPHS; COMPLEX NETWORK MODELS; DEGREE DISTRIBUTION;

COMPUTER NETWORKS;

EID: 24344470678     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527954_12     Document Type: Conference Paper

References (17)

1. J. Abello, P.M. Pardalos, and M.G.G. Resende. On maximum clique problems in very large graphs. In AMS-DIMACS Series on Discrete Mathematics and Theoretical Computer Science, editors, External Memory Algorithms, volume 50, 1999.
2. R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics 74, 47, 2002.
3. R. Albert, H. Jeong, and A.-L. Barabási. Diameter of the world wide web. Nature, 401:130-131, 1999.
4. Source code for the random bipartite graph generator. http://www.liafa.jussieu.fr/~guillaume/programs/.
5. S.N. Dorogovtsev and J.F.F. Mendes. Evolution of networks. Adv. Phys. 51, 1079-1187, 2002.
6. R. Ferrer and R.V. Solé. The small-world of human language. In Proceedings of the Royal Society of London, volume B268, pages 2261-2265, 2001.
7. M. Garey and D. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
8. R. Govindan and H. Tangmunarunkit. Heuristics for internet map discovery. In IEEE INFOCOM 2000, pages 1371-1380, Tel Aviv, Israel, March 2000. IEEE.
9. H. Jeong, B. Tombor, R. Albert, Z. Oltvai, and A.-L. Barabási. The large-scale organization of metabolic networks. Nature, 407, 651, 2000.
10. L. Lu. The diameter of random massive graphs. In ACM-SIAM, editor, 12th Ann. Symp. on Discrete Algorithms (SODA), pages 912-921, 2001.
11. S.D. Monson, N.J. Pullman, and R. Rees. A survey of clique and biclique coverings and factorizations of (0,1)-matrices. Bull. Inst. Combin. Appl., 14:17-86, 1995.
12. M.E.J. Newman. Scientific collaboration networks: I. Network construction and fundamental results. Phys. Rev. E, 64, 2001.
13. M.E.J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167-256, 2003.
14. M.E.J. Newman, D.J. Watts, and S.H. Strogatz. Random graph models of social networks. Proc. Natl. Acad. Sci. USA, 99 (Suppl. 1):2566-2572, 2002.
15. J. Orlin. Contentment in graph theory: Covering graphs with cliques. Indigationes Mathematicae, 80:406-424, 1977.
16. Bible Today New International Version, http://www.tniv.info/bible/.
17. D.J. Watts and S.H. Strogatz. Collective dynamics of small-world networks. Nature, 393:440-442, 1998.