Author:
Saha Sanjit Kumar,Schmitt Ingo
Reference10 articles.
1. Behar, R., Cohen, S. (2018) “Finding All Maximal Connected s-Cliques in Social Networks” Proceedings of the 21st International Conference on Extending Database Technology (EDBT) 26-29.
2. Palsetia, D., Patwary, M.M.A., Hendrix, W., Agrawal, A., Choudhary, A. (2014) “Clique Guided Community Detection.” IEEE International Conference on Big Data 500-509.
3. QQL: A DB&IR Query Language.;Schmitt;VLDB J.,2008
4. Algorithm 457: finding all cliques of an undirected graph.;Bron;Communications of the ACM,1973
5. The worst-case time complexity for generating all maximal cliques and computational experiments.;Tomita;Theoretical Computer Science,2006
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献