High Performance Computing - HiPC 2003

DOI10.1007/B94479MaRDI QIDQ5193152zbMATH OpenOpenAlexFDO

Authors Enyue Lü, S. Q. Zheng

Publication date 11 August 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b94479

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)

Recommendations

• A sublinear parallel algorithm for stable matching
• scientific article; zbMATH DE number 1003296
• A parallel algorithm to solve the stable marriage problem
• The average performance of a parallel stable mariage algorithm
• A New Approach to Stable Matching Problems

Cited in

(2)

• Almost stable matchings by truncating the Gale-Shapley algorithm
• Aggregative coarsening for multilevel hypergraph partitioning

This page was built for publication: High Performance Computing - HiPC 2003

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