SOFSEM 2006: Theory and Practice of Computer Science
Springer, Berlin, Heidelberg
Chapter title |
On the NP-Completeness of Some Graph Cluster Measures
|
---|---|
Chapter number | 51 |
Book title |
SOFSEM 2006: Theory and Practice of Computer Science
|
Published by |
Springer, Berlin, Heidelberg, January 2006
|
DOI | 10.1007/11611257_51 |
Book ISBNs |
978-3-54-031198-0, 978-3-54-032217-7
|
Authors |
Jiří Šíma, Satu Elisa Schaeffer |
Country | Count | As % |
---|---|---|
Netherlands | 1 | 2% |
France | 1 | 2% |
Brazil | 1 | 2% |
United Kingdom | 1 | 2% |
Russia | 1 | 2% |
Japan | 1 | 2% |
United States | 1 | 2% |
Unknown | 35 | 83% |
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 13 | 31% |
Researcher | 9 | 21% |
Student > Master | 6 | 14% |
Professor | 3 | 7% |
Student > Doctoral Student | 2 | 5% |
Other | 6 | 14% |
Unknown | 3 | 7% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 28 | 67% |
Chemistry | 2 | 5% |
Mathematics | 1 | 2% |
Physics and Astronomy | 1 | 2% |
Business, Management and Accounting | 1 | 2% |
Other | 2 | 5% |
Unknown | 7 | 17% |