Approximating weighted matchings in parallel
type: Item
instance of: scholarly article
title: Approximating weighted matchings in parallel
zbMATH Open document ID: 1184.68638
author: Stefan Hougardy
author: Doratha E. Vinkemeier
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5664469
zbMATH Keywords: approximation algorithms
zbMATH Keywords: parallel algorithms
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: graph algorithms
zbMATH Keywords: maximum weight matching
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.03.005
OpenAlex ID: W2039562302
cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
cites work: A linear-time approximation algorithm for weighted matchings in graphs
cites work: Approximating matchings in parallel
cites work: A New Parallel Algorithm for the Maximal Independent Set Problem
cites work: Q4023519
cites work: A Las Vegas RNC algorithm for maximum matching
cites work: Q4389326
cites work: Constructing a perfect matching is in random NC
cites work: Matching is as easy as matrix inversion
cites work: Parallel approximation algorithms for maximum weighted matching in general graphs
cites work: A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
DOI: 10.1016/J.IPL.2006.03.005
description: scientific article; zbMATH DE number 5664469