On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs.
Yanamandram B. VenkatakrishnanH. Naresh KumarPublished in: WALCOM (2019)
Keyphrases
- undirected graph
- vertex set
- edge weights
- weighted graph
- directed graph
- labeled graphs
- spanning tree
- minimum weight
- attributed graphs
- approximation algorithms
- edge detection
- connected components
- graph structure
- maximum cardinality
- directed acyclic graph
- minimum cost
- graph matching
- minimum spanning trees
- complex networks
- graph databases
- average degree
- random graphs
- strongly connected
- adjacency matrix
- hamiltonian cycle
- graph kernels
- minimum spanning tree
- graph partitioning
- graph model
- graph theory
- edge information
- similarity measure
- neural network