Funder
National Science Foundation
Office of Naval Research
Oklahoma State University
Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference59 articles.
1. On maximum clique problems in very large graphs;Abello,1999
2. Agency, D. A. R. P. (2011). Graph–theoretic Research in Algorithms and the PHenomenology of Social networks (GRAPHS). Broad Agency Announcement.
3. A graph-theoretic definition of a sociometric clique;Alba;Journal of Mathematical Sociology,1973
4. Alhajj, R., & Rokne, J. (Eds.) (2018). Encyclopedia of social network analysis and mining. New York: Springer.
5. Graph partitioning and graph clustering: Tenth Dimacs implementation challenge workshop;Bader,2013
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献