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 Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree
|
---|---|
Chapter number | 10 |
Book title |
Mathematical Foundations of Computer Science 2012
|
Published in |
Lecture notes in computer science, January 2012
|
DOI | 10.1007/978-3-642-32589-2_10 |
Book ISBNs |
978-3-64-232588-5, 978-3-64-232589-2
|
Authors |
Tatsuya Akutsu, Takeyuki Tamura |
Editors |
Branislav Rovan, Vladimiro Sassone, Peter Widmayer |
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 % |
---|---|---|
India | 1 | 25% |
Unknown | 3 | 75% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 75% |
Professor > Associate Professor | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 25% |
Computer Science | 1 | 25% |
Agricultural and Biological Sciences | 1 | 25% |
Engineering | 1 | 25% |