The shape of the search tree for the maximum clique problem, and the implications for parallel branch and bound
- Submitting institution
-
University of Glasgow
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 11-02841
- Type
- D - Journal article
- DOI
-
10.1145/2742359
- Title of journal
- ACM Transactions on Parallel Computing
- Article number
- 8
- First page
- -
- Volume
- 2
- Issue
- 1
- ISSN
- 2329-4949
- Open access status
- Out of scope for open access requirements
- Month of publication
- May
- Year of publication
- 2015
- URL
-
http://eprints.gla.ac.uk/103693/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- ORIGINALITY: We investigate how to make best use of multiple processors when solving a fundamental NP-hard problem, namely finding a maximum clique in a graph. We propose a low-overhead and high-diversity work splitting strategy that avoids strong commitment to weak early heuristic advice. SIGNIFICANCE: Potential for super-linear speedups in applications in biochemistry, bioinformatics, computer vision and the analysis of social networks. RIGOUR: An empirical study was performed over DIMACS, BHOSLIB and protein product benchmark problems, using up to 64 cores for more than three months.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
