Funder
National Natural Science Foundation of China
University of Electronic Science and Technology of China
Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference29 articles.
1. Massive quasi-clique detection;Abello;LATIN 2002: Theoretical Informatics,2002
2. An analytical comparison of the LP relaxations of integer models for the k-club problem;Almeida;European Journal of Operational Research,2014
3. Bader, D. A., Meyerhenke, H., Sanders, P., & Wagner, D. (Eds.) (2013). Graph partitioning and graph clustering, 10th DIMACS implementation challenge workshop, georgia institute of technology, atlanta, ga, usa, february 13-14, 2012. proceedings (vol. 588). Contemporary Mathematics. American Mathematical Society.
4. Clique relaxations in social network analysis: The maximum k-plex problem;Balasundaram;Operations Research,2011
5. Clique-detection models in computational biochemistry and genomics;Butenko;European Journal of Operational Research,2006
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献