Algorithms and Computation
Springer Berlin Heidelberg
Chapter title |
Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach
|
---|---|
Chapter number | 58 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, December 2005
|
DOI | 10.1007/11602613_58 |
Book ISBNs |
978-3-54-030935-2, 978-3-54-032426-3
|
Authors |
Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov, Fomin, Fedor V., Grandoni, Fabrizio, Pyatkin, Artem V., Stepanov, Alexey A. |
Country | Count | As % |
---|---|---|
Japan | 1 | 10% |
Brazil | 1 | 10% |
Unknown | 8 | 80% |
Readers by professional status | Count | As % |
---|---|---|
Student > Master | 3 | 30% |
Student > Doctoral Student | 2 | 20% |
Lecturer | 1 | 10% |
Student > Ph. D. Student | 1 | 10% |
Student > Bachelor | 1 | 10% |
Other | 2 | 20% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 8 | 80% |
Mathematics | 1 | 10% |
Agricultural and Biological Sciences | 1 | 10% |