An exact bit-parallel algorithm for the maximum clique problem
From MaRDI portal
Publication:709206
DOI10.1016/J.COR.2010.07.019zbMATH Open1231.90369OpenAlexW2068617151MaRDI QIDQ709206FDOQ709206
Authors: Pablo San Segundo, Agustín Jiménez, Diego Rodriguez-Losada 
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.07.019
Recommendations
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Coloring of graphs and hypergraphs (05C15)
Cites Work
- An improved branch and bound algorithm for the maximum clique problem
- Algorithm 457: finding all cliques of an undirected graph
- Reducibility among Combinatorial Problems
- Title not available (Why is that?)
- A fast algorithm for the maximum clique problem
- Clique-detection models in computational biochemistry and genomics
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Evolution towards the maximum clique
- Continuous Characterizations of the Maximum Clique Problem
- A new trust region technique for the maximum weight clique problem
- An exact algorithm for the maximum clique problem
- An algorithm for finding a maximum clique in a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (55)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- Differentiable discrete optimization using dataless neural networks
- A differentiable approach to the maximum independent set problem using dataless neural networks
- A branch-and-cut algorithm for the edge interdiction clique problem
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound
- Relaxed approximate coloring in exact maximum clique search
- A post-quantum associative memory
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem
- The maximum clique interdiction problem
- Title not available (Why is that?)
- A new branch-and-bound algorithm for the maximum weighted clique problem
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
- General cut-generating procedures for the stable set polytope
- hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
- An exact exponential time algorithm for counting bipartite cliques
- Solving the maximum vertex weight clique problem via binary quadratic programming
- Computing maximum \(k\)-defective cliques in massive graphs
- Recognition of split-graphic sequences
- A parallel branch and bound algorithm for the maximum labelled clique problem
- Title not available (Why is that?)
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- Breakout local search for maximum clique problems
- On comparing algorithms for the maximum clique problem
- An enhanced bitstring encoding for exact maximum clique search in sparse graphs
- Parallel Maximum Clique Algorithms with Applications to Network Analysis
- A new exact maximum clique algorithm for large and massive sparse graphs
- Infra-chromatic bound for exact maximum clique search
- Social structure optimization in team formation
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
- CliSAT: a new exact algorithm for hard maximum clique problems
- Multi-threading a state-of-the-art maximum clique algorithm
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem
- The stable set problem: clique and nodal inequalities revisited
- A maximum edge-weight clique extraction algorithm based on branch-and-bound
- On finding \(k\)-cliques in \(k\)-partite graphs
- Incremental Upper Bound for the Maximum Clique Problem
- On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems
- On the Power of Simple Reductions for the Maximum Independent Set Problem
- A greedy algorithm to construct covering arrays using a graph representation
- Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques
- Efficiently enumerating all maximal cliques with bit-parallelism
- A review on algorithms for maximum clique problems
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
- Title not available (Why is that?)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- Exact algorithms for maximum clique: a computational study
- Finding near-optimal independent sets at scale
- Reducing hypergraph coloring to clique search
- An improved bit parallel exact maximum clique algorithm
- A parallel maximum clique algorithm for large and massive sparse graphs
Uses Software
This page was built for publication: An exact bit-parallel 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 Q709206)
