Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/479
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorCheng, TCE-
dc.creatorKang, L-
dc.creatorShan, E-
dc.date.accessioned2014-12-11T08:27:33Z-
dc.date.available2014-12-11T08:27:33Z-
dc.identifier.issn0166-218X-
dc.identifier.urihttp://hdl.handle.net/10397/479-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsDiscrete Applied Mathematics © 2008 Elsevier. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectAlgorithmen_US
dc.subjectPermutation graphen_US
dc.subjectPaired-dominationen_US
dc.titleA polynomial-time algorithm for the paired-domination problem on permutation graphsen_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationAuthor name used in this publication: T. C. E. Chengen_US
dc.identifier.spage262-
dc.identifier.epage271-
dc.identifier.volume157-
dc.identifier.issue2-
dc.identifier.doi10.1016/j.dam.2008.02.015-
dcterms.abstractA set S of vertices in a graph H=(V,E) with no isolated vertices is a paired-dominating set of H if every vertex of H is adjacent to at least one vertex in S and if the subgraph induced by S contains a perfect matching. Let G be a permutation graph and π be its corresponding permutation. In this paper we present an O(mn) time algorithm for finding a minimum cardinality paired-dominating set for a permutation graph G with n vertices and m edges.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationDiscrete applied mathematics, Jan. 2009, v. 157, no. 2, p. 262-271-
dcterms.isPartOfDiscrete applied mathematics-
dcterms.issued2009-01-28-
dc.identifier.isiWOS:000262017600007-
dc.identifier.scopus2-s2.0-56349153226-
dc.identifier.rosgroupidr42484-
dc.description.ros2008-2009 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
paired-domination in permutation of graphs 4.pdfPre-published version244.76 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

210
Last Week
0
Last month
Citations as of Aug 13, 2025

Downloads

172
Citations as of Aug 13, 2025

SCOPUSTM   
Citations

24
Last Week
0
Last month
0
Citations as of Sep 12, 2025

WEB OF SCIENCETM
Citations

22
Last Week
0
Last month
0
Citations as of Dec 18, 2025

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.