k-neighborhood-covering and -independence problems for chordal graphs

檔案

日期

1998-11-01

類型

期刊名稱

SIAM JOURNAL ON DISCRETE MATHEMATICS

卷期與頁次

第 11 卷第 4 期,頁 633–643

ISSN

0895-4801

語言

英文

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

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

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/31808