An exact algorithm for the maximum clique problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4059145 (Why is no real title available?)
- Algorithm 457: finding all cliques of an undirected graph
- Clique detection for nondirected graphs: Two new algorithms
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Determining the number of internal stability of a graph
- Finding a Maximum Clique in an Arbitrary Graph
- Finding a Maximum Independent Set
- On the complexity of approximating the independent set problem (extended abstract)
- On the theory of graphs
Cited in
(only showing first 100 items - show all)- Speeding up branch and bound algorithms for solving the maximum clique problem
- CliSAT: a new exact algorithm for hard maximum clique problems
- Improvements to MCS algorithm for the maximum clique problem
- Metric space method for constructing splitting partitions of graphs
- An algorithm for finding a maximum clique in a graph
- An experimental analysis of exact algorithms for the maximum clique problem
- Test case generators and computational results for the maximum clique problem
- An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning
- Correlation between the continuous-time quantum walk and cliques in graphs and its application
- The stable set problem: clique and nodal inequalities revisited
- An Exact Algorithm for the Minimum Dominating Clique Problem
- A maximum edge-weight clique extraction algorithm based on branch-and-bound
- An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique
- Permutation codes with specified packing radius
- Maximum weight relaxed cliques and Russian doll search revisited
- Maximum weight perfect matching problem with additional disjunctive conflict constraints
- Incremental Upper Bound for the Maximum Clique Problem
- On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes
- Decomposing clique search problems into smaller instances based on node and edge colorings
- Ramsey theory and integrality gap for the independent set problem
- A new algorithm for the maximum-weight clique problem
- On the asymmetric representatives formulation for the vertex coloring problem
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- A new table of permutation codes
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- Solving the maximum clique problem using a tabu search approach
- Diversification strategies in tabu search algorithms for the maximum clique problem
- Evaluating the effects of the clique selection in exact graph colouring algorithms
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems
- A metaheuristic algorithm for large maximum weight independent set problems
- A greedy algorithm to construct covering arrays using a graph representation
- Why is maximum clique often easy in practice?
- Efficiently enumerating all maximal cliques with bit-parallelism
- A review on algorithms for maximum clique problems
- A clique search problem and its application to machine scheduling
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- scientific article; zbMATH DE number 1424217 (Why is no real title available?)
- An algorithm for reporting maximal \(c\)-cliques
- Exact algorithms for maximum clique: a computational study
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem
- A parallel maximum clique algorithm for large and massive sparse graphs
- An improved bit parallel exact maximum clique algorithm
- Parallelization of a branch-and-bound algorithm for the maximum weight clique problem
- On the minimum number of logical clauses inferred from examples
- On solving the maximum clique problem
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound
- Generation of lower bounds for minimum span frequency assignment
- An exact algorithm for the maximum stable set problem
- Coloring the nodes of a directed graph
- Clique algorithms for classifying substructures in generalized quadrangles
- On identifying dominant cliques.
- An effective and fast heuristic for the dial-a-ride problem
- Numerical experiments with LP formulations of the maximum clique problem
- Reachability cuts for the vehicle routing problem with time windows
- Estimating clique size by coloring the nodes of auxiliary graphs
- The maximum clique problem
- Solving larger maximum clique problems using parallel quantum annealing
- An exact algorithm for the maximum probabilistic clique problem
- On risk-averse maximum weighted subgraph problems
- Subgraph extraction and metaheuristics for the maximum clique problem
- A new algorithm for the maximum clique problem
- Modelling competitive Hopfield networks for the maximum clique problem
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- A post-quantum associative memory
- Algorithms for finding maximum transitive subtournaments
- A new branch-and-bound algorithm for the maximum weighted clique problem
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Maximum independent sets and supervised learning
- Risk transportation via a clique number problem formulation.
- Dual inequalities for stabilized column generation revisited
- A column generation and branch-and-cut algorithm for the channel assignment problem
- Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm
- A branch-and-bound approach for maximum quasi-cliques
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- An ant algorithm for the maximum number of 3-cliques in 3-partite graphs
- The composition of semi-finished inventories at a solid board plant.
- Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
- An exact algorithm for parallel machine scheduling with conflicts
- Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
- An exact exponential time algorithm for counting bipartite cliques
- An exact bit-parallel algorithm for the maximum clique problem
- Edge coloring of graphs, uses, limitation, complexity
- The k-Dense Method to Extract Communities from Complex Networks
- Optimal wafer cutting in shuttle layout problems
- Minimization of a quadratic pseudo-Boolean function
- A New Approach for Solving the Maximum Clique Problem
- hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
- scientific article; zbMATH DE number 1786225 (Why is no real title available?)
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Exact algorithms for the minimum cost vertex blocker clique problem
- Coloring the edges of a directed graph
- A complete resolution of the Keller maximum clique problem
- Detecting robust cliques in graphs subject to uncertain edge failures
- Solving the maximum vertex weight clique problem via binary quadratic programming
- A Max-SAT Inference-Based Pre-processing for Max-Clique
- An adaptive multistart tabu search approach to solve the maximum clique problem
- Complementarity in finite quantum mechanics and computer-aided computations of complementary observables
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- Distance-based clique relaxations in networks: \(s\)-clique and \(s\)-club
This page was built for publication: An exact algorithm for the maximum clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922964)
