Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number.
Johan M. M. van RooijPublished in: CIAC (2010)
Keyphrases
- computational complexity
- space complexity
- running times
- optimization problems
- graph theory
- memory requirements
- small number
- theoretical analysis
- run times
- worst case
- real time
- machine learning algorithms
- benchmark datasets
- times faster
- recently developed
- significant improvement
- execution times
- neural network
- data sets
- computational cost
- computationally efficient
- combinatorial optimization
- support vector
- finite number
- data structure