An enhanced bitstring encoding for exact maximum clique search in sparse graphs
From MaRDI portal
Publication:5268925
DOI10.1080/10556788.2017.1281924zbMath1365.05162OpenAlexW2579912193MaRDI QIDQ5268925
Jorge Artieda, Mikhail Batsyn, Pablo San Segundo, Panos M. Pardalos
Publication date: 21 June 2017
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2017.1281924
Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)
Related Items (4)
On comparing algorithms for the maximum clique problem ⋮ The maximum independent union of cliques problem: complexity and exact approaches ⋮ Why Is Maximum Clique Often Easy in Practice? ⋮ BBMCW
Uses Software
Cites Work
- Infra-chromatic bound for exact maximum clique search
- A new exact maximum clique algorithm for large and massive sparse graphs
- An adaptive multistart tabu search approach to solve the maximum clique problem
- Fast local search for the maximum independent set problem
- An exact bit-parallel algorithm for the maximum clique problem
- An exact algorithm for the maximum clique problem
- An improved bit parallel exact maximum clique algorithm
- Relaxed approximate coloring in exact maximum clique search
- A review on algorithms for maximum clique problems
- A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
- Finding a Maximum Clique in an Arbitrary Graph
- On chromatic number of graphs and set-systems
- Algorithm 457: finding all cliques of an undirected graph
This page was built for publication: An enhanced bitstring encoding for exact maximum clique search in sparse graphs
