scientific article; zbMATH DE number 975369

zbMATH Open0861.68064MaRDI QIDQ5284043FDOQ5284043

Authors: Gur Saran Adhar, Shietung Peng 

Publication date: 11 May 1997

Title of this publication is not available (Why is that?)

Recommendations

• An optimal parallel matching algorithm for cographs
• Parallel Algorithm for Cograph Recognition with Applications
• Publication:4489037
• An improved parallel algorithm for maximal matching

zbMATH Keywords

parallel algorithmmaximum matchingcograph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (5)

• Parallel graph algorithms for finding weighted matchings and subgraphs in computational science
• An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs
• An optimal parallel matching algorithm for cographs
• On parallel recognition of cographs
• A faster parallel connectivity algorithm on cographs

This page was built for publication:

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