Double vertex-edge domination in graphs: complexity and algorithms.
H. Naresh KumarD. PradhanYanamandram B. VenkatakrishnanPublished in: J. Appl. Math. Comput. (2021)
Keyphrases
- computational complexity
- representational power
- data structure
- learning algorithm
- significant improvement
- worst case
- theoretical analysis
- edge weights
- space complexity
- graph theory
- shortest path
- computationally efficient
- optimization problems
- data mining
- weighted graph
- complexity analysis
- search algorithm
- high computational complexity
- lower complexity
- multiscale
- maximum clique