A compact data structure and parallel algorithms for permutation graphs

DOI10.1007/3-540-60618-1_89MaRDI QIDQ6122238zbMATH OpenFDO

Authors Jens Gustedt, M. 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

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

Recommendations

• Efficient parallel algorithms for permutation graphs
• Parallel algorithms for permutation graphs
• Coloring permutation graphs in parallel
• scientific article; zbMATH DE number 1436135
• Coloring permutation graphs in parallel

Cites work

• scientific article; zbMATH DE number 3825206 (Why is no real title available?)
• scientific article; zbMATH DE number 140457 (Why is no real title available?)
• scientific article; zbMATH DE number 1554930 (Why is no real title available?)
• On testing isomorphism of permutation graphs
• Parallel Merge Sort
• Partial orders of dimension 2
• Transitive Orientation of Graphs and Identification of Permutation Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6122238)