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

Authors:
B. S. Panda;D. Pradhan
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 5
Cited 0

Paired-domination of Trees

Journal of Global Optimization
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
A linear-time algorithm for paired-domination problem in strongly chordal graphs

Information Processing Letters
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.04

Visualization

Abstract

A set D of vertices of a graph G=(V,E) is a dominating set of G if every vertex in V@?D has at least one neighbor in D. A dominating set D of G is a paired-dominating set of G if the induced subgraph, G[D], has a perfect matching. The paired-domination problem is for a given graph G and a positive integer k to answer if G has a paired-dominating set of size at most k. The paired-domination problem is known to be NP-complete even for bipartite graphs. In this paper, we propose a linear time algorithm to compute a minimum paired-dominating set of a convex bipartite graph.