Finding a Maximum Clique in an Arbitrary Graph
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Approximating the maximum vertex/edge weighted clique using local search
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
- Maximal chordal subgraphs
- Reduction of indefinite quadratic programs to bilinear programs
- Detecting embedded Horn structure in propositional logic
- Counting clique trees and computing perfect elimination schemes in parallel
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- An algorithm for finding a maximum clique in a graph
- Facets for node packing
- Test case generators and computational results for the maximum clique problem
- A fast algorithm for the maximum weight clique problem
- The maximum clique problem
- An exact algorithm for the maximum stable set problem
- A multi-KP modeling for the maximum-clique problem
- Vertex packing problem application to the design of electronic testing fixtures
- Solving the anti-covering location problem using Lagrangian relaxation
- A combinatorial column generation algorithm for the maximum stable set problem
- Enumerating all connected maximal common subgraphs in two graphs
- A fast algorithm for the maximum clique problem
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- Ramsey theory and integrality gap for the independent set problem
- The maximum clique interdiction problem
- Decomposing clique search problems into smaller instances based on node and edge colorings
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
- Modelling competitive Hopfield networks for the maximum clique problem
- A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- Diversification strategies in tabu search algorithms for the maximum clique problem
- Solving hard set covering problems
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Fixed cardinality stable sets
- Computing maximum \(k\)-defective cliques in massive graphs
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound
- The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope
- Speeding up branch and bound algorithms for solving the maximum clique problem
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- Median graphs: A genetic approach based on new theoretical properties
- A branch-and-price approach for the partition coloring problem
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- Subgraph extraction and metaheuristics for the maximum clique problem
- Solving the maximum clique problem using a tabu search approach
- Phased local search for the maximum clique problem
- Improvements to MCS algorithm for the maximum clique problem
- A simple simulated annealing algorithm for the maximum clique problem
- Genetic algorithmic approach to find the maximum weight independent set of a graph
- Clique-detection models in computational biochemistry and genomics
- A generalization of chordal graphs and the maximum clique problem
- Chordal editing is fixed-parameter tractable
- Safe lower bounds for graph coloring
- scientific article; zbMATH DE number 2185638 (Why is no real title available?)
- An algorithm for finding a maximum weighted independent set in an arbitrary graph
- An integer programming approach for solving the p-dispersion problem
- Heuristics for the generalized median graph problem
- scientific article; zbMATH DE number 3890750 (Why is no real title available?)
- Breakout local search for maximum clique problems
- Infra-chromatic bound for exact maximum clique search
- A new exact maximum clique algorithm for large and massive sparse graphs
- A Max-SAT Inference-Based Pre-processing for Max-Clique
- An adaptive multistart tabu search approach to solve the maximum clique problem
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- On finding \(k\)-cliques in \(k\)-partite graphs
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
- scientific article; zbMATH DE number 4059145 (Why is no real title available?)
- On the lcm of the Differences of Eight Primes
- A global optimization approach for solving the maximum clique problem
- An exact algorithm for the maximum probabilistic clique problem
- On risk-averse maximum weighted subgraph problems
- scientific article; zbMATH DE number 1303602 (Why is no real title available?)
- Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
- Distributed algorithms for maximum cliques
- scientific article; zbMATH DE number 1500539 (Why is no real title available?)
- scientific article; zbMATH DE number 1560331 (Why is no real title available?)
- Computing and Combinatorics
- scientific article; zbMATH DE number 1380608 (Why is no real title available?)
- Using Fifth Generation Tools for Solving the Clique Number Problem
- An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning
- Branch-and-bound techniques for the maximum planar subgraph problem∗
- A branch and cut solver for the maximum stable set problem
- A tutorial on branch and cut algorithms for the maximum stable set problem
- An analysis of parameter adaptation in reactive tabu search
- A parallel maximum clique algorithm for large and massive sparse graphs
- An enhanced bitstring encoding for exact maximum clique search in sparse graphs
- A complete resolution of the Keller maximum clique problem
- A dynamic programming approach for timing and designing clique algorithms
- scientific article; zbMATH DE number 956841 (Why is no real title available?)
- scientific article; zbMATH DE number 956844 (Why is no real title available?)
- scientific article; zbMATH DE number 7651158 (Why is no real title available?)
- A branch and bound algorithm for the maximum clique problem
- A branch and bound algorithm for the maximum clique problem
- A generalization of maximal independent sets
- A set packing model for the ground holding problem in congested networks
- A branch-and-cut algorithm for the maximum cardinality stable set problem
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
- CliSAT: a new exact algorithm for hard maximum clique problems
- On streaming algorithms for geometric independent set and clique
- Maximum weight perfect matching problem with additional disjunctive conflict constraints
- Finding near-optimal weight independent sets at scale
- Variable neighborhood search for the maximum clique
- An exact approach to the problem of extracting an embedded network matrix
- Finding conflict-free minimum weight spanning trees using maximal stable sets of the conflict graph
This page was built for publication: Finding a Maximum Clique in an Arbitrary Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3741641)
