scientific article; zbMATH DE number 1471955

zbMATH Open0949.05079MaRDI QIDQ4489037

Zhenfa Liu, Jun Ma

Publication date: 11 December 2000

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

zbMATH Keywords

parallel maximal matching algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem ⋮ Improved processor bounds for combinatorial problems in RNC ⋮ An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs

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 Q4489037)