1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorChang, MSen_US
dc.contributor.authorWu, SCen_US
dc.contributor.authorChang, GJen_US
dc.contributor.authorYeh, HGen_US
dc.date.accessioned2014-12-08T15:42:52Z-
dc.date.available2014-12-08T15:42:52Z-
dc.date.issued2002-01-15en_US
dc.identifier.issn0166-218Xen_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0166-218X(00)00330-9en_US
dc.identifier.urihttp://hdl.handle.net/11536/29069-
dc.description.abstractThe 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.isoen_USen_US
dc.subjectdominationen_US
dc.subjectdistance-hereditary graphen_US
dc.subjectneighborhooden_US
dc.subjecttwinen_US
dc.subjectleafen_US
dc.subjectlabelingen_US
dc.titleDomination in distance-hereditary graphsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0166-218X(00)00330-9en_US
dc.identifier.journalDISCRETE APPLIED MATHEMATICSen_US
dc.citation.volume116en_US
dc.citation.issue1-2en_US
dc.citation.spage103en_US
dc.citation.epage113en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000173568800006-
dc.citation.woscount7-
Appears in Collections:Articles


Files in This Item:

  1. 000173568800006.pdf

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.

Related Contents
Loading...