Algorithms and Computation
Springer Berlin Heidelberg
Chapter title |
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
|
---|---|
Chapter number | 17 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, December 2005
|
DOI | 10.1007/11602613_17 |
Book ISBNs |
978-3-54-030935-2, 978-3-54-032426-3
|
Authors |
L. Khachiyan, E. Boros, K. Borys, K. Elbassioni, V. Gurvich, K. Makino, Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V., Makino, K. |
Country | Count | As % |
---|---|---|
United States | 1 | 11% |
Unknown | 8 | 89% |
Readers by professional status | Count | As % |
---|---|---|
Professor | 3 | 33% |
Student > Doctoral Student | 1 | 11% |
Lecturer | 1 | 11% |
Student > Master | 1 | 11% |
Professor > Associate Professor | 1 | 11% |
Other | 0 | 0% |
Unknown | 2 | 22% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 2 | 22% |
Computer Science | 2 | 22% |
Agricultural and Biological Sciences | 1 | 11% |
Medicine and Dentistry | 1 | 11% |
Unknown | 3 | 33% |