Random Walk in Large Real-World Graphs for Finding Smaller Vertex Cover
暂无分享,去创建一个
Abdul Sattar | Kaile Su | Yi Fan | Chengqian Li | Zongjie Ma
[1] Ryan A. Rossi,et al. Coloring large complex networks , 2014, Social Network Analysis and Mining.
[2] Abdul Sattar,et al. Local search with edge weighting and configuration checking heuristics for minimum vertex cover , 2011, Artif. Intell..
[3] Jin-Kao Hao,et al. General swap-based multiple neighborhood tabu search for the maximum independent set problem , 2015, Eng. Appl. Artif. Intell..
[4] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[5] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[6] Takuya Akiba,et al. Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover , 2014, Theor. Comput. Sci..
[7] Wayne Pullan. Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers , 2009, Discret. Optim..
[8] Malte Helmert,et al. A Stochastic Local Search Approach to Vertex Cover , 2007, KI.
[9] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[10] Abdul Sattar,et al. NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover , 2014, J. Artif. Intell. Res..
[11] Ryan A. Rossi,et al. The Network Data Repository with Interactive Graph Analytics and Visualization , 2015, AAAI.
[12] Wayne J. Pullan,et al. Dynamic Local Search for the Maximum Clique Problem , 2011, J. Artif. Intell. Res..
[13] Shaowei Cai,et al. Balance between Complexity and Quality: Local Search for Minimum Vertex Cover in Massive Graphs , 2015, IJCAI.
[14] Xing Xu,et al. A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences , 2004, Bioinform..
[15] Ryan A. Rossi,et al. Fast maximum clique algorithms for large graphs , 2014, WWW.
[16] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[17] Mason A. Porter,et al. Social Structure of Facebook Networks , 2011, ArXiv.