On the signed Roman k-domination: Complexity and thin torus graphs.
Zehui ShaoSandi KlavzarZepeng LiPu WuJin XuPublished in: Discret. Appl. Math. (2017)
Keyphrases
- real time
- pattern recognition
- computational complexity
- worst case
- decision problems
- graph theoretic
- databases
- database
- graph structure
- space complexity
- polynomial time complexity
- graph kernels
- random graphs
- massively parallel
- graph model
- graph theory
- graph matching
- computational cost
- image segmentation
- machine learning