Complexity and Algorithms for Semipaired Domination in Graphs.
Michael A. HenningArti PandeyVikash TripathiPublished in: CoRR (2019)
Keyphrases
- graph theory
- worst case
- computational complexity
- orders of magnitude
- polynomial time complexity
- data structure
- high computational complexity
- machine learning algorithms
- lower bound
- computational cost
- computationally efficient
- decision problems
- space complexity
- theoretical analysis
- computationally complex
- lower complexity
- times faster
- data sets
- np complete
- optimization problems
- feature selection