Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/478
| Title: | Paired domination on interval and circular-arc graphs | Authors: | Cheng, TCE Kang, L Ng, CTD |
Issue Date: | 1-Oct-2007 | Source: | Discrete applied mathematics, Oct 2007, v. 155, no. 16, p. 2077-2086 | Abstract: | We study the paired-domination problem on interval graphs and circular-arc graphs. Given an interval model with endpoints sorted, we give an O(m+n) time algorithm to solve the paired-domination problem on interval graphs. The result is extended to solve the paired-domination problem on circular-arc graphs in O(m(m+n)) time. | Keywords: | Interval graph Circular-arc graph Paired domination |
Publisher: | Elsevier | Journal: | Discrete applied mathematics | ISSN: | 0166-218X | DOI: | 10.1016/j.dam.2007.05.011 | Rights: | Discrete Applied Mathematics © 2007 Elsevier. The journal web site is located at http://www.sciencedirect.com. |
| Appears in Collections: | Journal/Magazine Article |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| DAM6479.pdf | Pre-published version | 189.81 kB | Unknown | View/Open |
Access
View full-text via PolyU eLinks 
Page views
146
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
222
Citations as of Apr 21, 2024
SCOPUSTM
Citations
42
Last Week
0
0
Last month
0
0
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
40
Last Week
0
0
Last month
0
0
Citations as of Apr 25, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.