Parallel algorithms for P4-comparability graphs

DOI10.1016/J.JALGOR.2003.11.005zbMATH Open1066.68159OpenAlexW2466977395MaRDI QIDQ4818673

Leonidas Palios, Stavros D. Nikolopoulos

Publication date: 1 October 2004

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2003.11.005

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (2)

Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation ⋮ Unnamed Item

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Parallel algorithms for a class of graphs generated recursively 👍 👎
• \(P_ 4\)-comparability graphs 👍 👎
• Parallel algorithms for permutation graphs 👍 👎
• A fast parallel algorithm to recognize P4-sparse graphs 👍 👎
• Parallel algorithms for parity graphs 👍 👎
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems 👍 👎
• Parallel algorithms for cographs and parity graphs with applications 👍 👎
• Parallel algorithms for planar graph isomorphism and related problems 👍 👎

This page was built for publication: Parallel algorithms for P4-comparability graphs