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 |
A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees
|
---|---|
Chapter number | 80 |
Book title |
Computing and Combinatorics
|
Published by |
Springer, Berlin, Heidelberg, August 2005
|
DOI | 10.1007/11533719_80 |
Book ISBNs |
978-3-54-028061-3, 978-3-54-031806-4
|
Authors |
Wen-Lian Hsu, Hsu, Wen-Lian |
Mendeley readers
The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 6 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Lecturer | 1 | 17% |
Student > Doctoral Student | 1 | 17% |
Student > Bachelor | 1 | 17% |
Researcher | 1 | 17% |
Professor > Associate Professor | 1 | 17% |
Other | 0 | 0% |
Unknown | 1 | 17% |
Readers by discipline | Count | As % |
---|---|---|
Agricultural and Biological Sciences | 2 | 33% |
Computer Science | 1 | 17% |
Mathematics | 1 | 17% |
Unknown | 2 | 33% |