For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Glasgow

Return to search Previous output Next output
Output 59 of 146 in the submission
Article title

Exact algorithms for maximum clique: a computational study

Type
D - Journal article
Title of journal
Algorithms
Article number
-
Volume number
5
Issue number
4
First page of article
545
ISSN of journal
1999-4893
Year of publication
2012
URL
-
Number of additional authors
0
Additional information

<12>This paper is a detailed empirical study of algorithms for the maximum clique problem, a problem that is of growing importance due to study of social networks. A large empirical study is performed over a variety of random and real problems, new variants of the algorithms are presented and it is shown that some reported results are flawed. All code and data are made available so that experiments can be faithfully replicated. Algorithms is a new online, open access journal.

Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
4
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-