Paired domination on interval and circular-arc graphs

Authors:
T. C. E. Cheng;L. Y. Kang;C. T. Ng
Affiliations:
Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong and Department of Mathematics, Shanghai University, Shanghai 200444, China;Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 5
Cited 12

Total domination in interval graphs revisited

Information Processing Letters
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs

SIAM Journal on Computing
An O(n2 algorithm for circular-arc graph recognition

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Paired-domination of Trees

Journal of Global Optimization
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

A polynomial-time algorithm for the paired-domination problem on permutation graphs

Discrete Applied Mathematics
Hardness results and approximation algorithms for (weighted) paired-domination in graphs

Theoretical Computer Science
Distance paired-domination problems on subclasses of chordal graphs

Theoretical Computer Science
A linear-time algorithm for paired-domination problem in strongly chordal graphs

Information Processing Letters
On the distance paired domination of generalized Petersen graphs P(n,1) and P(n,2)

Journal of Combinatorial Optimization
Which trees have a differentiating-paired dominating set?

Journal of Combinatorial Optimization
Upper paired-domination in claw-free graphs

Journal of Combinatorial Optimization
A characterization of graphs with disjoint dominating and paired-dominating sets

Journal of Combinatorial Optimization
Complexity of distance paired-domination problem in graphs

Theoretical Computer Science
An O(n)-time algorithm for the paired domination problem on permutation graphs

European Journal of Combinatorics
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph

Discrete Applied Mathematics
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.05

Visualization

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.