Coloring permutation graphs in parallel

A coloring of a graph G is an assignment of colors to its vertices so that no two adjacent vertices have the same color. We study the problem of coloring permutation graphs using certain properties of the lattice representation of a permutation and relationships between permutations, directed acyclic graphs and rooted trees having specific key properties. We propose an efficient parallel algorithm which colors an n-node permutation graph in O(log2 n) time using O(n2/log n) processors on the CREW PRAM model. Specifically, given a permutation π we construct a tree T*[π], which we call coloring-permutation tree, using certain combinatorial properties of π. We show that the problem of coloring a permutation graph is equivalent to finding vertex levels in the coloring-permutation tree.

[1]  Jeremy P. Spinrad,et al.  On Comparability and Permutation Graphs , 1985, SIAM J. Comput..

[2]  A. Lempel,et al.  Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[3]  Mikhail J. Atallah,et al.  Finding a minimum independent dominating set in a permutation graph , 1988, Discret. Appl. Math..

[4]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[5]  John H. Reif,et al.  Synthesis of Parallel Algorithms , 1993 .

[6]  Philippe Flajolet,et al.  An introduction to the analysis of algorithms , 1995 .

[7]  Martin Farber,et al.  Domination in Permutation Graphs , 1985, J. Algorithms.

[8]  Gen-Huey Chen,et al.  Generate all maximal independent sets in permutation graphs , 1993 .

[9]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[10]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[11]  Waldemar W. Koczkodaj,et al.  Advances in Computing and Information — ICCI '90 , 1990, Lecture Notes in Computer Science.

[12]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

[13]  Joseph Y.-T. Leung,et al.  Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs , 1984, J. Algorithms.

[14]  S. S. Ravi,et al.  An O(n log n) Lower Bound for Decomposing a Set of Points into Chains , 1989, Inf. Process. Lett..

[15]  Johan Håstad,et al.  Optimal bounds for decision problems on the CRCW PRAM , 1987, STOC.

[16]  Gen-Huey Chen,et al.  Parallel algorithms for permutation graphs , 1993, BIT Comput. Sci. Sect..

[17]  Jeremy P. Spinrad,et al.  Bipartite permutation graphs , 1987, Discret. Appl. Math..

[18]  Mi Lu.  Parallel Computation of Longest-Common-Subsequence , 1990, ICCI.

[19]  Ernst W. Mayr,et al.  Applications of Parallel Scheduling Algorithms to Families of Perfect Graphs , 1990 .

[20]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .

[21]  Vijay V. Vazirani,et al.  NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching , 1985, FSTTCS.

[22]  Shuji Tsukiyama,et al.  A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..

[23]  Kenneth J. Supowit,et al.  Decomposing a Set of Points into Chains, with Applications to Permutation and Circle Graphs , 1985, Inf. Process. Lett..

[24]  Dieter Kratsch,et al.  On Domination Problems for Permutation and Other Graphs , 1987, Theor. Comput. Sci..

[25]  Maria I. Andreou,et al.  NC Coloring Algorithms for Permutation Graphs , 1999, Nord. J. Comput..

[26]  Charis Papadopoulos,et al.  On the performance of the first-fit coloring algorithm on permutation graphs , 2000, Inf. Process. Lett..