The Maximum Partition Matching Problem with Applications

DOI10.1137/S009753979630012XMaRDI QIDQ4229415zbMATH OpenFDO

Authors Chi-Chang Chen, Jianer Chen

Publication date 22 February 1999

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S009753979630012X

zbMATH Keywords

greedy algorithmmaximum matchingparallel routingstar network

Mathematics Subject Classification ID

Partitions of sets (05A18) Transversal (matching) theory (05D15) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Recommendations

• An optimal parallel algorithm for maximal matching
• OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS
• Efficient algorithms for path partitions
• An improved parallel algorithm for maximal matching

Cited in

(1)

• scientific article; zbMATH DE number 1472182 (Why is no real title available?)

This page was built for publication: The Maximum Partition Matching Problem with Applications

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