Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs

Full metadata record

DC Field	Value	Language
dc.contributor.author	Yeh, HG	en_US
dc.contributor.author	Chang, GJ	en_US
dc.date.accessioned	2014-12-08T15:43:37Z	-
dc.date.available	2014-12-08T15:43:37Z	-
dc.date.issued	2001-07-28	en_US
dc.identifier.issn	0304-3975	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/S0304-3975(00)00225-5	en_US
dc.identifier.uri	http://hdl.handle.net/11536/29498	-
dc.description.abstract	A graph is distance-hereditary if the distance between any two vertices in a connected induced subgraph is the same as in the original graph. This paper presents efficient algorithms for solving the weighted connected k-domination and the weighted k-dominating clique problems in distance-hereditary graphs, (C) 2001 Elsevier Science B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	distance-hereditary graph	en_US
dc.subject	connected k-domination	en_US
dc.subject	k-dominating clique	en_US
dc.subject	algorithm	en_US
dc.title	Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs	en_US
dc.type	Article; Proceedings Paper	en_US
dc.identifier.doi	10.1016/S0304-3975(00)00225-5	en_US
dc.identifier.journal	THEORETICAL COMPUTER SCIENCE	en_US
dc.citation.volume	263	en_US
dc.citation.issue	1-2	en_US
dc.citation.spage	3	en_US
dc.citation.epage	8	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000170245800002	-
Appears in Collections:	Conferences Paper

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.