Author:
Baumgart Andreas,Müller-Funk Ulrich
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Abello J, Resende MGC, Sudarsky S (2002) Massive quasi-clique detection. In: LATIN ’02: Proceedings of the 5th Latin American Symposium on Theoretical Informatics, Springer, London, UK, pp 598–612
2. Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575–577, DOI
http://doi.acm.org/10.1145/362342.362367
3. Cazals F, Karande C (2008) A note on the problem of reporting maximal cliques. Theor Comput Sci 407(1–3):564–568, DOI10.1016/j.tcs.2008.05.010,
http://dx.doi.org/10.1016/j.tcs.2008.05.010
4. Derényi I, Palla G, Vicsek T (2005) Clique percolation in random networks. Phys Rev Lett 94(16):160,202, DOI10.1103/PhysRevLett.94.160202,
http://dx.doi.org/10.1103/PhysRevLett.94.160202
5. Dhillon I, Guan Y, Kulis B (2005) A unified view of kernel k-means, spectral clustering and graph cuts. Tech. rep., UTCS Technical Report No. TR-04-25