Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/479
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Cheng, TCE | - |
dc.creator | Kang, L | - |
dc.creator | Shan, E | - |
dc.date.accessioned | 2014-12-11T08:27:33Z | - |
dc.date.available | 2014-12-11T08:27:33Z | - |
dc.identifier.issn | 0166-218X | - |
dc.identifier.uri | http://hdl.handle.net/10397/479 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | Discrete Applied Mathematics © 2008 Elsevier. The journal web site is located at http://www.sciencedirect.com. | en_US |
dc.subject | Algorithm | en_US |
dc.subject | Permutation graph | en_US |
dc.subject | Paired-domination | en_US |
dc.title | A polynomial-time algorithm for the paired-domination problem on permutation graphs | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.description.otherinformation | Author name used in this publication: T. C. E. Cheng | en_US |
dc.identifier.spage | 262 | - |
dc.identifier.epage | 271 | - |
dc.identifier.volume | 157 | - |
dc.identifier.issue | 2 | - |
dc.identifier.doi | 10.1016/j.dam.2008.02.015 | - |
dcterms.abstract | A 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.accessRights | open access | en_US |
dcterms.bibliographicCitation | Discrete applied mathematics, Jan. 2009, v. 157, no. 2, p. 262-271 | - |
dcterms.isPartOf | Discrete applied mathematics | - |
dcterms.issued | 2009-01-28 | - |
dc.identifier.isi | WOS:000262017600007 | - |
dc.identifier.scopus | 2-s2.0-56349153226 | - |
dc.identifier.rosgroupid | r42484 | - |
dc.description.ros | 2008-2009 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
paired-domination in permutation of graphs 4.pdf | Pre-published version | 244.76 kB | Adobe PDF | View/Open |
Page views
148
Last Week
0
0
Last month
Citations as of Apr 14, 2024
Downloads
143
Citations as of Apr 14, 2024
SCOPUSTM
Citations
23
Last Week
0
0
Last month
0
0
Citations as of Apr 12, 2024
WEB OF SCIENCETM
Citations
21
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.