Complexity and Algorithms for Semipaired Domination in Graphs.
Michael A. HenningArti PandeyVikash TripathiPublished in: Theory Comput. Syst. (2020)
Keyphrases
- computational cost
- computational complexity
- orders of magnitude
- graph theory
- worst case
- space complexity
- high computational complexity
- lower complexity
- times faster
- computationally efficient
- memory requirements
- benchmark datasets
- machine learning algorithms
- theoretical analysis
- optimization problems
- significant improvement
- neural network
- computationally complex
- graph model
- weighted graph
- graph matching
- constraint satisfaction problems
- data structure
- social networks
- data mining