Abstract
Starting from a permutation of {0, ..., n – 1} we compute in parallel with a workload of O(n log n) a compact data structure of size O(n log n). This data structure allows to obtain the associated permutation graph and the transitive closure and reduction of the associated order of dimension 2 efficiently. The parallel algorithms obtained have a workload of O(m + n log n) where m is the number of edges of the permutation graph. They run in time O(log2 n) on a CREW PRAM.
Cite
CITATION STYLE
Gustedt, J., Morvan, M., & Viennot, L. (1995). A compact data structure and parallel algorithms for permutation graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1017, pp. 372–380). Springer Verlag. https://doi.org/10.1007/3-540-60618-1_89
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
