Contraction-based method for computing a lower bound on the clique number of a graph.
Assia GuehamHacène Aït HaddadèneAnass NagihPublished in: CoDIT (2019)
Keyphrases
- lower bound
- high accuracy
- computational complexity
- clustering method
- cost function
- preprocessing
- computational cost
- objective function
- detection method
- probabilistic model
- scheduling problem
- dynamic programming
- significant improvement
- similarity measure
- segmentation method
- combinatorial optimization
- graph structure
- graph construction