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 |
Making an arbitrary filled graph minimal by removing fill edges
|
---|---|
Chapter number | 130 |
Book title |
Algorithm Theory — SWAT'96
|
Published by |
Springer, Berlin, Heidelberg, July 1996
|
DOI | 10.1007/3-540-61422-2_130 |
Book ISBNs |
978-3-54-061422-7, 978-3-54-068529-6
|
Authors |
Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle, Blair, Jean R. S., Heggernes, Pinar, Telle, Jan Arne |
Mendeley readers
The data shown below were compiled from readership statistics for 5 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Germany | 1 | 20% |
Brazil | 1 | 20% |
Unknown | 3 | 60% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 2 | 40% |
Student > Ph. D. Student | 1 | 20% |
Lecturer | 1 | 20% |
Professor > Associate Professor | 1 | 20% |
Readers by discipline | Count | As % |
---|---|---|
Agricultural and Biological Sciences | 2 | 40% |
Computer Science | 2 | 40% |
Mathematics | 1 | 20% |