Discrete Mathematics and Theoretical Computer Science
Springer Berlin Heidelberg
Chapter title |
An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique
|
---|---|
Chapter number | 22 |
Book title |
Discrete Mathematics and Theoretical Computer Science
|
Published in |
Lecture notes in computer science, June 2003
|
DOI | 10.1007/3-540-45066-1_22 |
Book ISBNs |
978-3-54-040505-4, 978-3-54-045066-5
|
Authors |
Tomita, Etsuji, Seki, Tomokazu, Etsuji Tomita, Tomokazu Seki, Pinciu, Val |
Editors |
Cristian S. Calude, Michael J. Dinneen, Vincent Vajnovszki |
Country | Count | As % |
---|---|---|
Spain | 2 | 6% |
Unknown | 33 | 94% |
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 7 | 20% |
Student > Bachelor | 5 | 14% |
Professor | 4 | 11% |
Researcher | 4 | 11% |
Student > Ph. D. Student | 3 | 9% |
Other | 5 | 14% |
Unknown | 7 | 20% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 15 | 43% |
Engineering | 6 | 17% |
Mathematics | 3 | 9% |
Business, Management and Accounting | 2 | 6% |
Agricultural and Biological Sciences | 2 | 6% |
Other | 1 | 3% |
Unknown | 6 | 17% |