Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width.
Esther GalbyAndrea MunaroBernard RiesPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- computational complexity
- worst case
- np hard
- learning algorithm
- probabilistic model
- graph isomorphism
- preprocessing
- k means
- detection algorithm
- special case
- search space
- computational cost
- optimal solution
- simulated annealing
- expectation maximization
- matching algorithm
- polynomial time complexity
- objective function
- np hardness
- minimum spanning tree
- graph model
- optimization algorithm
- linear programming
- neural network
- dynamic programming