An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs

Authors:
H. S. Chao;F. R. Hsu;Richard C. T. Lee
Affiliations:
-;-;-
Venue:
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Year:
1998

Citing 4
Cited 0

A new approach for the domination problem on permutation graphs

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An $O(N + M)$-Time Algorithm for Finding a Minimum-WeightDominating Set in a Permutation Graph

SIAM Journal on Computing
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A dominating set D of an undirected graph G is a set of vertices such that every vertex not in D is adjacent to at least one vertex in D. Given a undirected graph G, the minimal cardinality dominating set problem is to find a dominating set of G with minimum number of vertices. The minimal cardinality dominating set problem is NP-hard for general graphs. For permutation graphs, the best-known algorithm ran in O(n log log n) time, where n is the number of vertices. In this paper, we present an optimal O(n) algorithm.