The complexity of the defensive domination problem in special graph classes.
Tínaz EkimArthur M. FarleyAndrzej ProskurowskiPublished in: Discret. Math. (2020)
Keyphrases
- complexity measures
- tractable cases
- graph structure
- computational complexity
- graph theory
- data sets
- equivalence classes
- decision problems
- neural network
- graph clustering
- graphical representation
- graph theoretic
- graph representation
- graph model
- graph matching
- directed graph
- graph mining
- class labels
- structured data
- shortest path
- random walk
- upper bound
- graph structures
- probabilistic model
- special case
- bounded degree