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.
Timeline
Mendeley readers
Chapter title |
Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs
|
---|---|
Chapter number | 10 |
Book title |
Computing and Combinatorics
|
Published by |
Springer, Berlin, Heidelberg, August 2002
|
DOI | 10.1007/3-540-45655-4_10 |
Book ISBNs |
978-3-54-043996-7, 978-3-54-045655-1
|
Authors |
Sun-yuan Hsieh, Chin-wen Ho, Tsan-sheng Hsu, Ming-tat Ko, Hsieh, Sun-yuan, Ho, Chin-wen, Hsu, Tsan-sheng, Ko, Ming-tat |
Mendeley readers
The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 3 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 2 | 67% |
Professor > Associate Professor | 1 | 33% |
Lecturer | 1 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 67% |
Mathematics | 1 | 33% |
Agricultural and Biological Sciences | 1 | 33% |