Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width.
Esther GalbyAndrea MunaroBernard RiesPublished in: CoRR (2018)
Keyphrases
- computational complexity
- worst case
- preprocessing
- np hard
- matching algorithm
- k means
- cost function
- dynamic programming
- computational cost
- polynomial time complexity
- particle swarm optimization
- graph isomorphism
- strongly polynomial
- detection algorithm
- optimization algorithm
- np complete
- linear programming
- probabilistic model