Pages that link to "Item:Q922964"

The following pages link to An exact algorithm for the maximum clique problem (Q922964):

Displaying 36 items.

• Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894) (← links)
• A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
• An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
• Lower bound algorithms for multiprocessor task scheduling with ready times (Q3410325) (← links)
• Clique algorithms for classifying substructures in generalized quadrangles (Q3439132) (← links)
• An Exact Algorithm for the Minimum Dominating Clique Problem (Q3499731) (← links)
• A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)
• On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes (Q3627689) (← links)
• An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique (Q3627690) (← links)
• The k-Dense Method to Extract Communities from Complex Networks (Q3627917) (← links)
• Distributed algorithms for maximum cliques (Q4338575) (← links)
• <i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964) (← links)
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315) (← links)
• A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q4632188) (← links)
• An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning (Q4816960) (← links)
• An exact algorithm for the maximal covering problem (Q4883162) (← links)
• A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
• (Q4945422) (← links)
• Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← links)
• Correlation between the continuous-time quantum walk and cliques in graphs and its application (Q5003363) (← links)
• Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← links)
• Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
• An enhanced bitstring encoding for exact maximum clique search in sparse graphs (Q5268925) (← links)
• A New Approach for Solving the Maximum Clique Problem (Q5434406) (← links)
• A branch and bound algorithm for the maximum clique problem (Q5905591) (← links)
• Algorithms for finding maximum transitive subtournaments (Q5963652) (← links)
• A post-quantum associative memory (Q6063372) (← links)
• A deterministic algorithm for the MST problem in constant rounds of congested clique (Q6065240) (← links)
• Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)
• Maximum independent sets and supervised learning (Q6151016) (← links)
• CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)
• Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693) (← links)
• Complementarity in finite quantum mechanics and computer-aided computations of complementary observables (Q6535144) (← links)
• A metaheuristic algorithm for large maximum weight independent set problems (Q6663969) (← links)