Parallel algorithms for permutation graphs

DOI10.1007/BF01990525zbMath0818.68091OpenAlexW2078117779MaRDI QIDQ1314630

Gen-Huey Chen, Chang Wu Yu

Publication date: 7 March 1994

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01990525

zbMATH Keywords

parallel algorithmspermutation graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (3)

Coloring permutation graphs in parallel ⋮ A parallel algorithm for solving the coloring problem on trapezoid graphs ⋮ Fully dynamic algorithms for permutation graph coloring

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposing a set of points into chains, with applications to permutation and circle graphs
• Bipartite permutation graphs
• Scanline algorithms on a grid
• Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
• On Comparability and Permutation Graphs
• Domination in permutation graphs
• On rectangular visibility
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
• Algorithms for the Longest Common Subsequence Problem
• Transitive Orientation of Graphs and Identification of Permutation Graphs

This page was built for publication: Parallel algorithms for permutation graphs