Domination in distance-hereditary graphs

doi:10.1016/S0166-218X(00)00330-9

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Chang, MS	en_US
dc.contributor.author	Wu, SC	en_US
dc.contributor.author	Chang, GJ	en_US
dc.contributor.author	Yeh, HG	en_US
dc.date.accessioned	2014-12-08T15:42:52Z	-
dc.date.available	2014-12-08T15:42:52Z	-
dc.date.issued	2002-01-15	en_US
dc.identifier.issn	0166-218X	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/S0166-218X(00)00330-9	en_US
dc.identifier.uri	http://hdl.handle.net/11536/29069	-
dc.description.abstract	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.	en_US
dc.language.iso	en_US	en_US
dc.subject	domination	en_US
dc.subject	distance-hereditary graph	en_US
dc.subject	neighborhood	en_US
dc.subject	twin	en_US
dc.subject	leaf	en_US
dc.subject	labeling	en_US
dc.title	Domination in distance-hereditary graphs	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/S0166-218X(00)00330-9	en_US
dc.identifier.journal	DISCRETE APPLIED MATHEMATICS	en_US
dc.citation.volume	116	en_US
dc.citation.issue	1-2	en_US
dc.citation.spage	103	en_US
dc.citation.epage	113	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000173568800006	-
dc.citation.woscount	7	-
顯示於類別：	期刊論文

文件中的檔案：

000173568800006.pdf

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。