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 |
An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
|
---|---|
Chapter number | 52 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, December 2015
|
DOI | 10.1007/978-3-662-48971-0_52 |
Book ISBNs |
978-3-66-248970-3, 978-3-66-248971-0
|
Authors |
Diptarka Chakraborty, Raghunath Tewari |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United States | 1 | 25% |
Unknown | 3 | 75% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Researcher | 2 | 50% |
Student > Master | 2 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 100% |