Local Search for Maximum Vertex Weight Clique on Large Sparse Graphs with Efficient Data Structures
暂无分享,去创建一个
Abdul Sattar | Kaile Su | Yi Fan | Lian Wen | Chengqian Li | Zongjie Ma | A. Sattar | Kaile Su | Zongjie Ma | Yi Fan | Chengqian Li | Lian Wen
[1] Uriel Feige,et al. Approximating Maximum Clique by Removing Subgraphs , 2005, SIAM J. Discret. Math..
[2] Luitpold Babel,et al. A fast algorithm for the maximum weight clique problem , 1994, Computing.
[3] Hyunju Lee,et al. WMAXC: A Weighted Maximum Clique Method for Identifying Condition-Specific Sub-Network , 2014, PloS one.
[4] Ke Xu,et al. Solving Maximum Weight Clique Using Maximum Satisfiability Reasoning , 2014, ECAI.
[5] Stanislav Busygin,et al. A new trust region technique for the maximum weight clique problem , 2006, Discret. Appl. Math..
[6] Volker Stix,et al. Approximating the maximum weight clique using replicator dynamics , 2000, IEEE Trans. Neural Networks Learn. Syst..
[7] F. Chung,et al. Complex Graphs and Networks , 2006 .
[8] Ke Xu,et al. A Simple Model to Generate Hard Satisfiable Instances , 2005, IJCAI.
[9] Aravind Srinivasan,et al. Structural and algorithmic aspects of massive social networks , 2004, SODA '04.
[10] Minghao Yin,et al. Two Efficient Local Search Algorithms for Maximum Weight Clique Problem , 2016, AAAI.
[11] Longin Jan Latecki,et al. Clustering Aggregation as Maximum-Weight Independent Set , 2012, NIPS.
[12] Patric R. J. Östergård,et al. A New Algorithm for the Maximum-Weight Clique Problem , 1999, Electron. Notes Discret. Math..
[13] Longin Jan Latecki,et al. Maximum weight cliques with mutex constraints for video object segmentation , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.
[14] Shaowei Cai,et al. Balance between Complexity and Quality: Local Search for Minimum Vertex Cover in Massive Graphs , 2015, IJCAI.
[15] Wayne J. Pullan,et al. Approximating the maximum vertex/edge weighted clique using local search , 2008, J. Heuristics.
[16] William Brendel,et al. Segmentation as Maximum-Weight Independent Set , 2010, NIPS.
[17] Sergiy Butenko,et al. Graph Domination, Coloring and Cliques in Telecommunications , 2006, Handbook of Optimization in Telecommunications.
[18] Ryan A. Rossi,et al. Fast maximum clique algorithms for large graphs , 2014, WWW.
[19] Roberto Battiti,et al. Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.
[20] Ryan A. Rossi,et al. The Network Data Repository with Interactive Graph Analytics and Visualization , 2015, AAAI.
[21] Ryan A. Rossi,et al. Coloring large complex networks , 2014, Social Network Analysis and Mining.
[22] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[23] Pablo Moscato,et al. Identification of a 5-Protein Biomarker Molecular Signature for Predicting Alzheimer's Disease , 2008, PloS one.
[24] David E. Goldberg,et al. Genetic Algorithms, Tournament Selection, and the Effects of Noise , 1995, Complex Syst..
[25] Mohamed R. Amer,et al. Multiobject tracking as maximum weight independent set , 2011, CVPR 2011.
[26] Fred W. Glover,et al. Multi-neighborhood tabu search for the maximum weight clique problem , 2012, Annals of Operations Research.
[27] Kazuaki Yamaguchi,et al. A New Exact Algorithm for the Maximum Weight Clique Problem , 2008 .