Frontiers in Algorithmics
Springer International Publishing
Chapter title |
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
|
---|---|
Chapter number | 21 |
Book title |
Frontiers in Algorithmics
|
Published by |
Springer International Publishing, January 2016
|
DOI | 10.1007/978-3-319-39817-4_21 |
Book ISBNs |
978-3-31-939816-7, 978-3-31-939817-4
|
Authors |
Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki |
Editors |
Daming Zhu, Sergey Bereg |
Country | Count | As % |
---|---|---|
Unknown | 6 | 100% |
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 50% |
Student > Master | 2 | 33% |
Student > Bachelor | 1 | 17% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 67% |
Chemistry | 1 | 17% |
Engineering | 1 | 17% |