Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
Journal
Theoretical Computer Science
Journal Volume
263
Journal Issue
1-2
Pages
3-8
Date Issued
2001
Author(s)
Abstract
A graph is distance-hereditary if the distance between any two vertices in a connected induced subgraph is the same as in the original graph. This paper presents efficient algorithms for solving the weighted connected k-domination and the weighted k-dominating clique problems in distance-hereditary graphs. © 2001 Elsevier Science B.V. All rights reserved.
SDGs
Type
journal article