scientific article; zbMATH DE number 1759463

zbMath0998.68229MaRDI QIDQ4536416

Ryuhei Uehara, Zhi-Zhong Chen

Publication date: 25 November 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph algorithmapproximation algorithmparallel algorithmmaximum weighted matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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) Approximation algorithms (68W25)

Related Items (2)

Distributed algorithms for covering, packing and maximum weighted matching ⋮ Constant-time local computation algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved parallel algorithm for maximal matching
• Approximation algorithms for weighted matching
• Constructing a perfect matching is in random NC
• The complexity of circuit value and network stability
• Approximating matchings in parallel
• A survey of heuristics for the weighted matching problem
• Efficient algorithms for finding maximum matching in graphs
• Paths, Trees, and Flowers

This page was built for publication: