Algorithmic aspect of k-tuple domination in graphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
420 | en_US |
dc.citation.issue |
3 | en_US |
dc.citation.spage |
415 | en_US |
dc.citation.volume |
6 | en_US |
dc.citation.woscount |
30 | |
dc.contributor.author |
Liao, CS | en_US |
dc.contributor.author |
Chang, GJ | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:41:57Z | |
dc.date.available |
2014-12-08T15:41:57Z | |
dc.date.issued |
2002-09-01 | en_US |
dc.description.abstract |
In a graph G, a vertex is said to dominate itself and all of its neighbors. For a fixed positive integer k, the k-tuple domination problem is to find a minimum sized vertex subset such that every vertex in the graph is dominated by at least k vertices in this set. The present paper studies the k-tuple domination problem in graphs from an algorithmic point of view. In particular, we give a linear-time algorithm for the 2-tuple domination problem in trees by employing a labeling method. | en_US |
dc.identifier.issn |
1027-5487 | en_US |
dc.identifier.journal |
TAIWANESE JOURNAL OF MATHEMATICS | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/28529 | |
dc.identifier.wosnumber |
WOS:000178773200010 | |
dc.language.iso |
en_US | en_US |
dc.subject |
domination | en_US |
dc.subject |
k-tuple domination | en_US |
dc.subject |
algorithm | en_US |
dc.subject |
tree | en_US |
dc.subject |
leaf | en_US |
dc.subject |
neighbor | en_US |
dc.title |
Algorithmic aspect of k-tuple domination in graphs | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文