Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs

檔案

日期

2001-07-28

期刊名稱

THEORETICAL COMPUTER SCIENCE

摘要

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, (C) 2001 Elsevier Science B.V. All rights reserved.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料