An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs

Authors:
H. S. Chao;F. R. Hsu;R. C. T. Lee
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics
Year:
2000

Citing 0
Cited 4

Acyclic domination on bipartite permutation graphs

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

Discrete Applied Mathematics
First-Fit coloring of {P5,K4-e}-free graphs

Discrete Applied Mathematics
An O(n)-time algorithm for the paired domination problem on permutation graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.04

Visualization

Abstract