k-path partitions in trees
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
233 | en_US |
dc.citation.issue |
1-3 | en_US |
dc.citation.spage |
227 | en_US |
dc.citation.volume |
78 | en_US |
dc.citation.woscount |
9 | |
dc.contributor.author |
Yan, JH | en_US |
dc.contributor.author |
Chang, GJ | en_US |
dc.contributor.author |
Hedetniemi, SM | en_US |
dc.contributor.author |
Hedetniemi, ST | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:01:23Z | |
dc.date.available |
2014-12-08T15:01:23Z | |
dc.date.issued |
1997-10-21 | en_US |
dc.description.abstract |
For a fixed positive integer k, the k-path partition problem is to partition the vertex set of a graph into the smallest number of paths such that each path has at most k vertices. The 2-path partition problem is equivalent to the edge-cover problem. This paper presents a linear-time algorithm for the k-path partition problem in trees. The algorithm is applicable to the problem of finding the minimum number of message originators necessary to broadcast a message to all vertices in a tree network in one or two time units. | en_US |
dc.identifier.issn |
0166-218X | en_US |
dc.identifier.journal |
DISCRETE APPLIED MATHEMATICS | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/248 | |
dc.identifier.wosnumber |
WOS:A1997YC69500017 | |
dc.language.iso |
en_US | en_US |
dc.title |
k-path partitions in trees | en_US |
dc.type |
Article | en_US |
檔案
- A1997YC69500017.pdf (436.5 KB, Adobe PDF)
所屬典藏: 期刊論文