Parallel comparability graph recognition and modular decomposition

DOI10.1007/3-540-60922-9_15MaRDI QIDQ4593927zbMATH OpenOpenAlexFDO

Authors M. Morvan, Laurent Viennot

Publication date 16 November 2017

Published in STACS 96 (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00471608/file/stacs96.pdf

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1003286
• Parallel algorithms for P4-comparability graphs
• Modular decomposition and transitive orientation
• Parallel Algorithm for Cograph Recognition with Applications
• A fast parallel algorithm to recognize partitionable graphs

Cited in

(1)

• Efficient parallel modular decomposition (extended abstract)

This page was built for publication: Parallel comparability graph recognition and modular decomposition

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