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 Compatible Decompositions of Eulerian Graphs and Their Transformations
|
---|---|
Chapter number | 62 |
Book title |
Algorithms — ESA 2002
|
Published by |
Springer, Berlin, Heidelberg, September 2002
|
DOI | 10.1007/3-540-45749-6_62 |
Book ISBNs |
978-3-54-044180-9, 978-3-54-045749-7
|
Authors |
Jana Maxová, Jaroslav Nešetřil |
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 % |
---|---|---|
Unknown | 4 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 2 | 50% |
Professor | 1 | 25% |
Lecturer | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 25% |
Business, Management and Accounting | 1 | 25% |
Computer Science | 1 | 25% |
Agricultural and Biological Sciences | 1 | 25% |