A compact data structure and parallel algorithms for permutation graphs

DOI10.1007/3-540-60618-1_89MaRDI QIDQ6122238

Jens Gustedt, Michel Morvan, Laurent Viennot

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00471607

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Cites Work

• Parallel Merge Sort
• On testing isomorphism of permutation graphs
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• Partial orders of dimension 2
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A compact data structure and parallel algorithms for permutation graphs