Publisher
Springer International Publishing
Reference18 articles.
1. Barabasi A-L, Albert R (1999) Emergence of scaling in random networks. Science 286:509–512
2. Batagelj V, Zaversnik M (2003) An O(m) algorithm for cores decomposition of networks. CoRR (Computing research repository),
arXiv:0310049
3. Blaar H, Karnstedt M, Lange T, Winter R (2005) Possibilities to solve the clique problem by thread parallelism using task pools. In: Proceedings of the 19th IEEE international parallel and distributed processing symposium (IPDPS05)Workshop 5 Volume 06 in Germany
4. Boccaletti S, Latorab V, Morenod Y, Chavez M, Hwang D-U (2006) Complex networks: structure and dynamics. Phys Rep 424:175–308
5. Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575–577