A compact data structure and parallel algorithms for permutation graphs

  • Jens Gustedt
  • Michel Morvan
  • Laurent Viennot
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1017)


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(log2n) on a CREW PRAM.


Parallel Algorithm Transitive Closure Compact Representation Adjacency List Permutation Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K.A. Baker, P.C. Fishburn, and F.S. Roberts. Partial orders of dimension 2. Networks, 2:11–28, 1971.Google Scholar
  2. 2.
    C.J. Colbourn. On testing isomorphism of permutation graphs. Networks, 11:13–21, 1981.Google Scholar
  3. 3.
    Richard Cole. Parallel merge sort. SIAM J. Comput., 17(4), august 1988.Google Scholar
  4. 4.
    Paul F. Dietz. Optimal algorithms for list indexing and subset rank. In Algorithms and data structures, Proc. workshop WADS '89, Ottawa/Canada, number 382 in Lect. Notes Comput. Sci., pages 39–86, 1989.Google Scholar
  5. 5.
    M. Fredman and M. Saks. The cell probe complexity of dynamic data structures. In 21st ACM STOC, pages 345–354, 1989.Google Scholar
  6. 6.
    M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1985.Google Scholar
  7. 7.
    A. Pnueli, A. Lempel, and W. Even. Transitive orientation of graphs and identification. Canad. J. Math., 23:160–175, 1971.Google Scholar
  8. 8.
    J. Spinrad and J. Valdes. Recognition and isomorphism of two dimensional partial oreders. In 10th Coll. on Automata, Language and Programming, number 154 in Lect. Notes Comput. Sci., pages 676–686, Berlin, 1983. Springer.Google Scholar
  9. 9.
    Jeremy Spinrad. Dimension and algorithms. In V. Bouchité and M. Morvan, editors, Orders, Algorithms, and Applications, number 831 in Lect. Notes Comput. Sci., pages 33–52. Springer-Verlag, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Jens Gustedt
    • 1
  • Michel Morvan
    • 2
  • Laurent Viennot
    • 2
  1. 1.Technische UniversitÄt BerlinBerlinGermany
  2. 2.LITP/IBP Université Paris 7 Denis DiderotParis Cedex 05

Personalised recommendations