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 |
Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs
|
---|---|
Chapter number | 11 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, December 1997
|
DOI | 10.1007/3-540-63890-3_11 |
Book ISBNs |
978-3-54-063890-2, 978-3-54-069662-9
|
Authors |
Takeaki Uno, Uno, Takeaki |
Mendeley readers
The data shown below were compiled from readership statistics for 61 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
France | 2 | 3% |
United States | 1 | 2% |
Greece | 1 | 2% |
Germany | 1 | 2% |
Unknown | 56 | 92% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 19 | 31% |
Researcher | 10 | 16% |
Student > Master | 8 | 13% |
Professor > Associate Professor | 5 | 8% |
Student > Bachelor | 4 | 7% |
Other | 10 | 16% |
Unknown | 5 | 8% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 30 | 49% |
Engineering | 10 | 16% |
Mathematics | 6 | 10% |
Physics and Astronomy | 4 | 7% |
Economics, Econometrics and Finance | 2 | 3% |
Other | 3 | 5% |
Unknown | 6 | 10% |