Parallel algorithms for P4-comparability graphs

DOI10.1016/J.JALGOR.2003.11.005MaRDI QIDQ4818673zbMATH OpenOpenAlexFDO

Authors Stavros D. Nikolopoulos, Leonidas Palios

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)

Recommendations

• Parallel algorithms for cographs and parity graphs with applications
• Parallel algorithms for parity graphs
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• scientific article; zbMATH DE number 3930349
• \(P_ 4\)-comparability graphs
• Parallel algorithms for a class of graphs generated recursively
• Parallel algorithms for permutation graphs
• A fast parallel algorithm to recognize P4-sparse graphs
• Parallel algorithms for finding connected components of a graph
• Parallel algorithms for planar graph isomorphism and related problems

Cited in

(3)

• Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation
• scientific article; zbMATH DE number 2081001 (Why is no real title available?)
• Parallel comparability graph recognition and modular decomposition

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

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