暂无分享,去创建一个
[1] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[2] Ryan A. Rossi,et al. Fast maximum clique algorithms for large graphs , 2014, WWW.
[3] Weijia Jia,et al. Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.
[4] Aravind Srinivasan,et al. Structural and algorithmic aspects of massive social networks , 2004, SODA '04.
[5] Ryan A. Rossi,et al. The Network Data Repository with Interactive Graph Analytics and Visualization , 2015, AAAI.
[6] Weijia Jia,et al. Vertex Cover: Further Observations and Further Improvements , 1999, J. Algorithms.
[7] Malte Helmert,et al. A Stochastic Local Search Approach to Vertex Cover , 2007, KI.
[8] Abdul Sattar,et al. NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover , 2014, J. Artif. Intell. Res..
[9] Shaowei Cai,et al. Balance between Complexity and Quality: Local Search for Minimum Vertex Cover in Massive Graphs , 2015, IJCAI.
[10] M. Trick,et al. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993 , 1996 .
[11] Ryan A. Rossi,et al. Coloring large complex networks , 2014, Social Network Analysis and Mining.
[12] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[13] Irit Dinur,et al. On the hardness of approximating label-cover , 2004, Inf. Process. Lett..
[14] O. Ugurlu,et al. New heuristic algorithm for unweighted minimum vertex cover , 2012, 2012 IV International Conference "Problems of Cybernetics and Informatics" (PCI).