Reducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem
暂无分享,去创建一个
[1] Pablo San Segundo,et al. Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver , 2010, Applied Intelligence.
[2] Etsuji Tomita,et al. An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique , 2003, DMTCS.
[3] Zhu Zhu,et al. Minimum Satisfiability and Its Applications , 2011, IJCAI.
[4] James A. Foster,et al. A hard problem for genetic algorithms: finding cliques in Keller graphs , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).
[5] Janez Konc,et al. An improved branch and bound algorithm for the maximum clique problem , 2007 .
[6] Steve Gregory,et al. Detecting communities in networks by merging cliques , 2009, 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems.
[7] Atsuhiro Takasu,et al. A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures , 2011, BMC Bioinformatics.
[8] Chu-Min Li,et al. An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem , 2010 .
[9] Robert M. Haralick,et al. Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..
[10] Shinya Takahashi,et al. A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique , 2010, WALCOM.
[11] Francesca Rossi,et al. Principles and Practice of Constraint Programming – CP 2003 , 2003, Lecture Notes in Computer Science.
[12] Cristian S. Calude,et al. Discrete Mathematics and Theoretical Computer Science , 2003, Lecture Notes in Computer Science.
[13] Ciaran McCreesh,et al. An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem , 2014, CPAIOR.
[14] Ciaran McCreesh,et al. The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and Bound , 2014, ACM Trans. Parallel Comput..
[15] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[16] Makoto Haraguchi,et al. Finding Conceptual Document Clusters with Improved Top-N Formal Concept Search , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06).
[17] Jean-Charles Régin,et al. Using Constraint Programming to Solve the Maximum Clique Problem , 2003, CP.
[18] Ciaran McCreesh,et al. Multi-Threading a State-of-the-Art Maximum Clique Algorithm , 2013, Algorithms.
[19] C. Spearman. The proof and measurement of association between two things. , 2015, International journal of epidemiology.
[20] Pablo San Segundo,et al. Relaxed approximate coloring in exact maximum clique search , 2014, Comput. Oper. Res..
[21] Pablo San Segundo,et al. An improved bit parallel exact maximum clique algorithm , 2013, Optim. Lett..
[22] Michel Gendreau,et al. Tabu search algorithms for the maximum clique problem , 1993, Cliques, Coloring, and Satisfiability.
[23] Chu Min Li,et al. Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem , 2010, 2010 22nd IEEE International Conference on Tools with Artificial Intelligence.
[24] Etsuji Tomita,et al. An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments , 2001, J. Glob. Optim..
[25] Hua Jiang,et al. Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem , 2013, 2013 IEEE 25th International Conference on Tools with Artificial Intelligence.
[26] Dusanka Janezic,et al. A Branch and Bound Algorithm for Matching Protein Structures , 2007, ICANNGA.
[27] Joseph C. Culberson,et al. Camouflaging independent sets in quasi-random graphs , 1993, Cliques, Coloring, and Satisfiability.
[28] Panos M. Pardalos,et al. Improvements to MCS algorithm for the maximum clique problem , 2014, J. Comb. Optim..
[29] Pablo San Segundo,et al. An exact bit-parallel algorithm for the maximum clique problem , 2011, Comput. Oper. Res..
[30] Dusanka Janezic,et al. Exact Parallel Maximum Clique Algorithm for General and Protein Graphs , 2013, J. Chem. Inf. Model..
[31] Jan Wessnitzer,et al. A Model of Non-elemental Associative Learning in the Mushroom Body Neuropil of the Insect Brain , 2007, ICANNGA.
[32] Carlo Mannino,et al. Solving hard set covering problems , 1995, Oper. Res. Lett..
[33] Béla Lantos,et al. Formation Control of Quadrotor Helicopters with Guaranteed Collision Avoidance via Safe Path , 2012 .
[34] Patrick Prosser,et al. Exact Algorithms for Maximum Clique: A Computational Study , 2012, Algorithms.