An improved bit parallel exact maximum clique algorithm
From MaRDI portal
Publication:1941191
DOI10.1007/S11590-011-0431-YzbMATH Open1268.90118OpenAlexW2008362324MaRDI QIDQ1941191FDOQ1941191
Authors: Pablo San Segundo, Fernando Matía, Diego Rodriguez-Losada, Miguel Hernando 
Publication date: 12 March 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: http://oa.upm.es/11804/
Recommendations
- An exact bit-parallel algorithm for the maximum clique problem
- An enhanced bitstring encoding for exact maximum clique search in sparse graphs
- A new exact maximum clique algorithm for large and massive sparse graphs
- A parallel maximum clique algorithm for large and massive sparse graphs
- Efficiently enumerating all maximal cliques with bit-parallelism
Cites Work
- An improved branch and bound algorithm for the maximum clique problem
- A fast algorithm for the maximum clique problem
- Clique-detection models in computational biochemistry and genomics
- An exact bit-parallel algorithm for the maximum 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?)
- A simple and faster branch-and-bound algorithm for finding a maximum clique
- Title not available (Why is that?)
Cited In (25)
- A branch-and-cut algorithm for the edge interdiction clique problem
- Relaxed approximate coloring in exact maximum clique search
- 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
- An exact bit-parallel algorithm for the maximum clique problem
- A parallel branch and bound algorithm for the maximum labelled clique problem
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
- An enhanced bitstring encoding for exact maximum clique search in sparse graphs
- On the power of simple reductions for the maximum independent set problem
- A new exact maximum clique algorithm for large and massive sparse graphs
- Infra-chromatic bound for exact maximum clique search
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- CliSAT: a new exact algorithm for hard maximum clique problems
- Multi-threading a state-of-the-art maximum clique algorithm
- A new upper bound for the maximum weight clique problem
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems
- Efficiently enumerating all maximal cliques with bit-parallelism
- A review on algorithms for maximum clique problems
- Title not available (Why is that?)
- Exact algorithms for maximum clique: a computational study
- Improved infra-chromatic bound for exact maximum clique search
- A parallel maximum clique algorithm for large and massive sparse graphs
Uses Software
This page was built for publication: An improved bit parallel exact maximum clique algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1941191)
