Domination in distance-hereditary graphs

Maw Shang Chang, Shaur Ching Wu, Gerard J. Chang, Hong Gwa Yeh

研究成果: 雜誌貢獻期刊論文同行評審

16 引文 斯高帕斯(Scopus)

摘要

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.

原文???core.languages.en_GB???
頁(從 - 到)103-113
頁數11
期刊Discrete Applied Mathematics
116
發行號1-2
DOIs
出版狀態已出版 - 15 1月 2002

指紋

深入研究「Domination in distance-hereditary graphs」主題。共同形成了獨特的指紋。

引用此