Domination in distance-hereditary graphs

檔案

日期

2002-01-15

類型

期刊名稱

DISCRETE APPLIED MATHEMATICS

卷期與頁次

第 116 卷第 1-2 期,頁 103–113

ISSN

0166-218X

語言

英文

摘要

The domination problem and its variants have been extensively studied in the literature. In this paper we investigate the domination problem in distance-hereditary graphs, In particular, we give a linear-time algorithm for the domination problem in distance-hereditary graphs by a labeling approach. We actually solve a more general problem, called the L-domination problem, which also includes the total domination problem as a special case. (C) 2002 Elsevier Science B.V. All rights reserved.

所屬典藏

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

引用此條目

Chang, M., Wu, S., Chang, G., & Yeh, H. (2002). Domination in distance-hereditary graphs. DISCRETE APPLIED MATHEMATICS, 116(1-2), 103–113. https://doi.org/10.1016/S0166-218X(00)00330-9

BibTeX RIS

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

分享

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