Roman {k}-domination in trees and complexity results for some classes of graphs.
Cai-Xia WangYu YangHong-Juan WangShou-Jun XuPublished in: J. Comb. Optim. (2021)
Keyphrases
- tractable cases
- bounded degree
- complexity measures
- decision trees
- worst case
- graph theoretic
- graph matching
- feature selection
- graph theory
- graph mining
- graph representation
- data sets
- polynomial time complexity
- tree nodes
- attributed graphs
- algebraic structures
- bounded treewidth
- tree structures
- optical character recognition
- space complexity
- directed graph
- np complete
- multi class
- computational cost
- lower bound
- computational complexity
- learning algorithm
- neural network