-distance dominating sets in a weighted graph and its spanning trees.
Sukhamay KunduPublished in: Inf. Process. Lett. (2019)
Keyphrases
- spanning tree
- weighted graph
- edge weights
- minimum spanning tree
- minimum weight
- edge disjoint
- shortest path
- graph model
- graph partitioning
- minimum spanning trees
- undirected graph
- graph structure
- maximum weight
- graph clustering
- euclidean distance
- distance function
- minimum cost
- distance measure
- special case
- normalized cut
- distance transform
- graph laplacian
- adjacency matrix
- np hard
- approximation algorithms
- data objects
- graph connectivity
- distance metric