Query-Driven Maximum Quasi-Clique Search
暂无分享,去创建一个
[1] Jeffrey Xu Yu,et al. Influential Community Search in Large Networks , 2015, Proc. VLDB Endow..
[2] Sergiy Butenko,et al. On the maximum quasi-clique problem , 2013, Discret. Appl. Math..
[3] László Lovász,et al. Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[4] Leland L. Beck,et al. Smallest-last ordering and clustering and graph coloring algorithms , 1983, JACM.
[5] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[6] Charu C. Aggarwal,et al. A Survey of Algorithms for Dense Subgraph Discovery , 2010, Managing and Mining Graph Data.
[7] Haixun Wang,et al. Online search of overlapping communities , 2013, SIGMOD '13.
[8] Guimei Liu,et al. Effective Pruning Techniques for Mining Quasi-Cliques , 2008, ECML/PKDD.
[9] Jeffrey Xu Yu,et al. Querying k-truss community in large and dynamic graphs , 2014, SIGMOD Conference.
[10] Charalampos E. Tsourakakis,et al. Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees , 2013, KDD.
[11] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[12] Aristides Gionis,et al. The community-search problem and how to plan a successful cocktail party , 2010, KDD.
[13] Panos M. Pardalos,et al. Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs , 2010, SEA.
[14] Thomas Stützle,et al. Stochastic Local Search: Foundations & Applications , 2004 .
[15] Celso C. Ribeiro,et al. Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.
[16] Divesh Srivastava,et al. Dense subgraph maintenance under streaming edge weight updates for real-time story identification , 2012, The VLDB Journal.
[17] Santo Fortunato,et al. Community detection in graphs , 2009, ArXiv.