Author:
Saito Kazumi,Yamada Takeshi,Kazama Kazuhiro
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Applegate, D., Johnson, D.S.: Clique-finding program dfmax.c, C program,
ftp://dimacs.rutgers.edu/pub/challenge/graph/solvers/
2. Batagelj, V., Zaversnik, M.: Generalized Cores, arXiv:cs.DS/0202039 (2002)
3. Lecture Notes in Computer Science,2005
4. Carragan, R., Pardalos, P.M.: An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9, 375–382 (1990)
5. Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of Web communities. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 150–160 (2000)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Comparative Analysis of Store Opening Strategy Based on Movement Behavior Model over Urban Street Networks;Complex Networks XI;2020
2. Community Extraction Method of Road Networks Based on Betweenness Contribution;Transactions of the Japanese Society for Artificial Intelligence;2020-01-01
3. An Efficient movie recommendation algorithm based on improved k-clique;Human-centric Computing and Information Sciences;2018-12
4. cSketch: a novel framework for capturing cliques from big graph;The Journal of Supercomputing;2017-08-01
5. CAST;Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management;2014-11-03