Using Constraint Programming to Solve the Maximum Clique Problem
Author:
- 1 January 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 634-648
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum CliqueLecture Notes in Computer Science, 2002
- The Maximum Clique Problem1999
- An algorithm for finding a maximum clique in a graphOperations Research Letters, 1997
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973