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 |
Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree
|
---|---|
Chapter number | 6 |
Book title |
Fundamentals of Computation Theory
|
Published by |
Springer, Berlin, Heidelberg, August 2013
|
DOI | 10.1007/978-3-642-40164-0_6 |
Book ISBNs |
978-3-64-240163-3, 978-3-64-240164-0
|
Authors |
Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano, Asahiro, Yuichi, Eto, Hiroshi, Ito, Takehiro, Miyano, Eiji |
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 > Associate Professor | 1 | 50% |
Unknown | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 50% |
Unknown | 1 | 50% |