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 |
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
|
---|---|
Chapter number | 12 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 2013
|
DOI | 10.1007/978-3-642-45043-3_12 |
Book ISBNs |
978-3-64-245042-6, 978-3-64-245043-3
|
Authors |
Hajo Broersma, Jiří Fiala, Petr A. Golovach, Tomáš Kaiser, Daniël Paulusma, Andrzej Proskurowski, Broersma, Hajo, Fiala, Jiří, Golovach, Petr A., Kaiser, Tomáš, Paulusma, Daniël, Proskurowski, Andrzej |
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 % |
---|---|---|
Unknown | 5 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 2 | 40% |
Researcher | 1 | 20% |
Student > Master | 1 | 20% |
Unknown | 1 | 20% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 80% |
Unknown | 1 | 20% |