Speeding up branch and bound algorithms for solving the maximum clique problem
Speeding up branch and bound algorithms for solving the maximum clique problem
About this item
Full title
Author / Creator
Publisher
Boston: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
Boston: Springer US
Subjects
More information
Scope and Contents
Contents
In this paper we consider two branch and bound algorithms for the maximum clique problem which demonstrate the best performance on DIMACS instances among the existing methods. These algorithms are MCS algorithm by Tomita et al. (
2010
) and MAXSAT algorithm by Li and Quan (
2010a
,
b
). We suggest a general approach which allows u...
Alternative Titles
Full title
Speeding up branch and bound algorithms for solving the maximum clique problem
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_1530978466
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_1530978466
Other Identifiers
ISSN
0925-5001
E-ISSN
1573-2916
DOI
10.1007/s10898-013-0075-9
