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 |
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2
|
---|---|
Chapter number | 21 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Cham, June 2017
|
DOI | 10.1007/978-3-319-68705-6_21 |
Book ISBNs |
978-3-31-968704-9, 978-3-31-968705-6
|
Authors |
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma, Golovach, Petr A., Heggernes, Pinar, Kratsch, Dieter, Lima, Paloma T., Paulusma, Daniël |
Mendeley readers
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 2 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 1 | 50% |
Researcher | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 100% |