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 |
Optimal Branch-Decomposition of Planar Graphs in O(n 3) Time
|
---|---|
Chapter number | 31 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer, Berlin, Heidelberg, July 2005
|
DOI | 10.1007/11523468_31 |
Book ISBNs |
978-3-54-027580-0, 978-3-54-031691-6
|
Authors |
Qian-Ping Gu, Hisao Tamaki |
Mendeley readers
The data shown below were compiled from readership statistics for 30 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 30 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 9 | 30% |
Student > Master | 6 | 20% |
Researcher | 4 | 13% |
Professor > Associate Professor | 3 | 10% |
Professor | 2 | 7% |
Other | 4 | 13% |
Unknown | 2 | 7% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 20 | 67% |
Mathematics | 4 | 13% |
Engineering | 2 | 7% |
Physics and Astronomy | 1 | 3% |
Agricultural and Biological Sciences | 1 | 3% |
Other | 0 | 0% |
Unknown | 2 | 7% |