Algorithms and Data Structures
Springer Berlin Heidelberg
Chapter title |
Faster enumeration of all spanning trees of a directed graph
|
---|---|
Chapter number | 82 |
Book title |
Algorithms and Data Structures
|
Published by |
Springer Berlin Heidelberg, January 1995
|
DOI | 10.1007/3-540-60220-8_82 |
Book ISBNs |
978-3-54-060220-0, 978-3-54-044747-4
|
Authors |
Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar |
Editors |
Selim G. Akl, Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro |
Country | Count | As % |
---|---|---|
Unknown | 8 | 100% |
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 38% |
Other | 2 | 25% |
Professor > Associate Professor | 1 | 13% |
Student > Master | 1 | 13% |
Unknown | 1 | 13% |
Readers by discipline | Count | As % |
---|---|---|
Business, Management and Accounting | 3 | 38% |
Computer Science | 3 | 38% |
Engineering | 1 | 13% |
Unknown | 1 | 13% |