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 |
Recognizing binary hamming graphs in O ( n 2 log n ) time
|
---|---|
Chapter number | 34 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 1990
|
DOI | 10.1007/3-540-53832-1_34 |
Book ISBNs |
978-3-54-053832-5, 978-3-54-046310-8
|
Authors |
Franz Aurenhammer, Johann Hagauer, Aurenhammer, Franz, Hagauer, Johann |
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% |
Lecturer | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 50% |
Agricultural and Biological Sciences | 1 | 50% |