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 |
Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time
|
---|---|
Chapter number | 9 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 2005
|
DOI | 10.1007/11604686_9 |
Book ISBNs |
978-3-54-031000-6, 978-3-54-031468-4
|
Authors |
Daniel Meister, Meister, Daniel |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 4 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 1 | 25% |
Professor > Associate Professor | 1 | 25% |
Lecturer | 1 | 25% |
Student > Doctoral Student | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 2 | 50% |
Computer Science | 1 | 25% |
Agricultural and Biological Sciences | 1 | 25% |