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

Authors:
Lei Chen;Changhong Lu;Zhenbing Zeng
Affiliations:
Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, 200062, PR China;Department of Mathematics, East China Normal University, Shanghai, 200241, PR China;Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, 200062, PR China
Venue:
Information Processing Letters
Year:
2009

Citing 10
Cited 4

Doubly lexical orderings of matrices

SIAM Journal on Computing
Three partition refinement algorithms

SIAM Journal on Computing
Labeling algorithms for domination problems in sun-free chordal graphs

Discrete Applied Mathematics
Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs

Discrete Mathematics - Topics on domination
Doubly lexical ordering of dense 0–1 matrices

Information Processing Letters
Paired-domination of Trees

Journal of Global Optimization
k-tuple domination in graphs

Information Processing Letters
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Paired domination on interval and circular-arc graphs

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

Discrete Applied Mathematics

Complexity of distance paired-domination problem in graphs

Theoretical Computer Science
Vertices in all minimum paired-dominating sets of block graphs

Journal of Combinatorial Optimization
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.89

Visualization

Abstract

Let G=(V,E) be a simple graph without isolated vertices. A vertex set S@?V is a paired-dominating set if every vertex in V-S has at least one neighbor in S and the induced subgraph G[S] has a perfect matching. In this paper, we present a linear-time algorithm to find a minimum paired-dominating set in strongly chordal graphs if the strong (elimination) ordering of the graph is given in advance.