Electronic Resource
Springer
Computational optimization and applications
3 (1994), S. 243-258
ISSN:
1573-2894
Keywords:
Maximum stable set
;
maximum clique
;
branch-and-bound
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract We describe a new branch-and-bound algorithm for the exact solution of the maximum cardinality stable set problem. The bounding phase is based on a variation of the standard greedy algorithm for finding a colouring of a graph. Two different node-fixing heuristics are also described. Computational tests on random and structured graphs and very large graphs corresponding to ‘real-life’ problems show that the algorithm is competitive with the fastest algorithms known so far.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01299447
Permalink
| Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |
