On the computational complexity of Roman2-domination in grid graphs.
Aflatoun AmouzandehAhmad MoradiPublished in: J. Comb. Optim. (2023)
Keyphrases
- computational complexity
- np complete
- high computational complexity
- graph theory
- special case
- motion estimation
- grid computing
- graph matching
- decision problems
- computational grids
- series parallel
- subgraph isomorphism
- np hard
- grid enabled
- low complexity
- grid structure
- grid cells
- graph clustering
- data sets
- computationally efficient
- computational cost
- data structure
- similarity measure
- data mining