Parallel algorithms for parity graphs

DOI10.1016/0196-6774(91)90025-TMaRDI QIDQ3201757zbMATH OpenOpenAlexFDO

Authors Teresa Przytycka, Derek G. Corneil

Publication date 1991

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

Full work available at URL https://doi.org/10.1016/0196-6774(91)90025-t

zbMATH Keywords

CREW PRAMmaximum cliqueparity graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 3889564
• Parallel algorithms for cographs and parity graphs with applications
• Parallel Algorithm for Cograph Recognition with Applications
• A fast parallel algorithm to recognize partitionable graphs
• Parallel algorithms for permutation graphs

Cited in

(11)

• On the extension of bipartite to parity graphs
• Graph-theoretical properties of parallelism in the digital plane
• scientific article; zbMATH DE number 6708339 (Why is no real title available?)
• scientific article; zbMATH DE number 3889564 (Why is no real title available?)
• scientific article; zbMATH DE number 4072403 (Why is no real title available?)
• scientific article; zbMATH DE number 500370 (Why is no real title available?)
• scientific article; zbMATH DE number 1102788 (Why is no real title available?)
• Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
• Parallel algorithms for series parallel graphs
• Parallel algorithms for P4-comparability graphs
• A digraph theoretic parallelism in block methods

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

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