Hardness and Approximation Results of Roman {3}-Domination in Graphs.
Pooja GoyalB. S. PandaPublished in: COCOON (2021)
Keyphrases
- graph theoretic
- learning theory
- graph theory
- approximation algorithms
- approximation error
- np hard
- weighted graph
- closed form
- directed graph
- error bounds
- computational complexity
- pattern recognition
- approximation methods
- relative error
- approximation schemes
- graph structure
- approximation ratio
- worst case
- bipartite graph
- phase transition
- graph matching
- constraint satisfaction
- graph model
- graph representation
- shortest path
- graph clustering
- np complete
- graph kernels
- special case
- graph construction
- np hardness
- search algorithm
- data sets