The following pages link to (Q4452109):
Displaying 42 items.
- Reducing graph coloring to clique search (Q326946) (← links)
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- Coloring the nodes of a directed graph (Q399510) (← links)
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs (Q496657) (← links)
- Co-2-plex vertex partitions (Q498448) (← links)
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
- The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
- An effective local search for the maximum clique problem (Q1041822) (← links)
- Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
- Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← links)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← links)
- Optimizing with minimum satisfiability (Q1761303) (← links)
- An improved bit parallel exact maximum clique algorithm (Q1941191) (← links)
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
- A clique search problem and its application to machine scheduling (Q2068853) (← links)
- Numerical experiments with LP formulations of the maximum clique problem (Q2103941) (← links)
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
- A greedy algorithm to construct covering arrays using a graph representation (Q2201668) (← links)
- Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
- Relaxed approximate coloring in exact maximum clique search (Q2257362) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- Estimating clique size by coloring the nodes of auxiliary graphs (Q2326165) (← links)
- Coloring the edges of a directed graph (Q2353348) (← links)
- A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318) (← links)
- Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← 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)
- A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)
- An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique (Q3627690) (← links)
- <i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964) (← links)
- A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q4632188) (← links)
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← links)
- Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
