1. On maximum clique problems in very large graphs;Abello,1999
2. On robust clusters of minimum cardinality in networks;Balasubramaniam;Ann. Oper. Res.,2017
3. Statistical analysis of financial networks;Boginski;Comput. Statist. Data Anal.,2005
4. Cai, S., 2015. Balance between complexity and quality: local search for minimum vertex cover in massive graphs. In: Proceedings of Twenty-Fourth International Joint Conference on Artificial Intelligence, Buenos Aires, Argentina, July 25–31, pp. 747–753.
5. Cai, S., Lin, J., Su, K., 2015. Two weighting local search for minimum vertex cover. In: Proceedings of Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 1107–1113.