標題: Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
作者: Yeh, HG
Chang, GJ
應用數學系
Department of Applied Mathematics
關鍵字: distance-hereditary graph;connected k-domination;k-dominating clique;algorithm
公開日期: 28-七月-2001
摘要: 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.
URI: http://dx.doi.org/10.1016/S0304-3975(00)00225-5
http://hdl.handle.net/11536/29498
ISSN: 0304-3975
DOI: 10.1016/S0304-3975(00)00225-5
期刊: THEORETICAL COMPUTER SCIENCE
Volume: 263
Issue: 1-2
起始頁: 3
結束頁: 8
顯示於類別:會議論文


文件中的檔案:

  1. 000170245800002.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。