ArticlesColoring permutation graphs in parallel
References (13)
- et al.
Finding a minimum independent dominating set in a permutation graph
Discrete Applied Mathematics
(1988) - et al.
Domination in permutation graphs
Journal of Algorithms
(1985) - et al.
Bipartite permutation graphs
Discrete Applied Mathematics
(1987) - et al.
On domination problems for permutation and other graphs
Theoretical Computer Science
(1987) Algorithmic Graph Theory and Perfect Graphs
(1980)An Introduction to Parallel Algorithms
(1992)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2004 Elsevier Ltd. All rights reserved.