k-neighborhood-covering and -independence problems for chordal graphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
643 | en_US |
dc.citation.issue |
4 | en_US |
dc.citation.spage |
633 | en_US |
dc.citation.volume |
11 | en_US |
dc.citation.woscount |
3 | |
dc.contributor.author |
Hwang, SF | 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:47:27Z | |
dc.date.available |
2014-12-08T15:47:27Z | |
dc.date.issued |
1998-11-01 | en_US |
dc.description.abstract |
Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A vertex z k-neighborhood-covers an edge (x, y) if d(z, x) less than or equal to k and d(z, y) less than or equal to k. A k-neighborhood-covering set is a set C of vertices such that every edge in E is k-neighborhood-covered by some vertex in C. A k-neighborhood-independent set is a set of edges in which no two distinct edges can be k-neighborhood-covered by the same vertex in V. In this paper we first prove that the neighborhood-covering and the k-neighborhood-independence problems are NP-complete for chordal graphs. We then present a linear-time algorithm for finding a minimum k-neighborhood-covering set and a maximum k-neighborhood-independent set for a strongly chordal graph provided that a strong elimination ordering is given in advance. | en_US |
dc.identifier.issn |
0895-4801 | en_US |
dc.identifier.journal |
SIAM JOURNAL ON DISCRETE MATHEMATICS | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/31808 | |
dc.identifier.wosnumber |
WOS:000075676500008 | |
dc.language.iso |
en_US | en_US |
dc.subject |
k-neighborhood-covering | en_US |
dc.subject |
k-neighborhood-independence | en_US |
dc.subject |
chordal graph | en_US |
dc.subject |
strongly chordal graph | en_US |
dc.subject |
strong elimination order | en_US |
dc.title |
k-neighborhood-covering and -independence problems for chordal graphs | en_US |
dc.type |
Article | en_US |
檔案
- 000075676500008.pdf (322.3 KB, Adobe PDF)
所屬典藏: 期刊論文
引用此條目
Hwang, S., & Chang, G. (1998). k-neighborhood-covering and -independence problems for chordal graphs. SIAM JOURNAL ON DISCRETE MATHEMATICS, 11(4), 633–643. https://ir.lib.nycu.edu.tw/handle/11536/31808
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/31808