Abstract
Abstract — We study the problem of coloring permutations graphs using some properties of the Lattice representation of a permutation and the relationship between permutations and binary search trees. We propose an efficient parallel algorithm which colors a permutation graph in O (log 2 n) time using O (n 2 /logn) processors on the CREW PRAM model, where n is the number of vertices in the permutation graph. 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. Our results improve in performance upon the best-known parallel algorithms for the same problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
