Experimental Algorithms
Springer, Berlin, Heidelberg
Chapter title |
Updating Directed Minimum Cost Spanning Trees
|
---|---|
Chapter number | 27 |
Book title |
Experimental Algorithms
|
Published by |
Springer, Berlin, Heidelberg, May 2006
|
DOI | 10.1007/11764298_27 |
Book ISBNs |
978-3-54-034597-8, 978-3-54-034598-5
|
Authors |
Gerasimos G. Pollatos, Orestis A. Telelis, Vassilis Zissimopoulos |
Country | Count | As % |
---|---|---|
Unknown | 11 | 100% |
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 4 | 36% |
Professor > Associate Professor | 2 | 18% |
Lecturer | 1 | 9% |
Student > Master | 1 | 9% |
Student > Doctoral Student | 1 | 9% |
Other | 2 | 18% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 5 | 45% |
Mathematics | 2 | 18% |
Engineering | 2 | 18% |
Psychology | 1 | 9% |
Agricultural and Biological Sciences | 1 | 9% |
Other | 0 | 0% |