You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
Approximating treewidth, pathwidth, and minimum elimination tree height
|
---|---|
Chapter number | 1 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 1991
|
DOI | 10.1007/3-540-55121-2_1 |
Book ISBNs |
978-3-54-055121-8, 978-3-54-046735-9
|
Authors |
Hans L. Bodlaender, John R. Gilbert, Hjálmtýr Hafsteinsson, Ton Kloks, Bodlaender, Hans L., Gilbert, John R., Hafsteinsson, Hjálmtýr, Kloks, Ton |
Mendeley readers
The data shown below were compiled from readership statistics for 16 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
India | 1 | 6% |
Unknown | 15 | 94% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Bachelor | 3 | 19% |
Student > Ph. D. Student | 3 | 19% |
Researcher | 2 | 13% |
Professor | 2 | 13% |
Other | 1 | 6% |
Other | 2 | 13% |
Unknown | 3 | 19% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 5 | 31% |
Mathematics | 3 | 19% |
Agricultural and Biological Sciences | 2 | 13% |
Business, Management and Accounting | 1 | 6% |
Unknown | 5 | 31% |