An optimal parallel matching algorithm for cographs

DOI10.1006/JPDC.1994.1067MaRDI QIDQ1338271zbMATH OpenOpenAlexFDO

Authors V. Pereyra

Publication date 27 November 1994

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1994.1067

zbMATH Keywords

cographscomplement-reducible 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 975369
• Parallel Algorithm for Cograph Recognition with Applications
• An efficient parallel algorithm for maximum matching for some classes of graphs
• An optimal parallel algorithm for maximal matching
• Parallel algorithm for cograph recognition with applications

Cited in

(7)

• A fast parallel algorithm to recognize P4-sparse graphs
• Parallel graph algorithms for finding weighted matchings and subgraphs in computational science
• Efficient parallel recognition of cographs
• An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
• Parallel algorithms for flexible pattern matching on big graphs
• A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
• A faster parallel connectivity algorithm on cographs

This page was built for publication: An optimal parallel matching algorithm for cographs

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