A sublinear parallel algorithm for stable matching
type: Item
instance of: scholarly article
title: A sublinear parallel algorithm for stable matching
zbMATH Open document ID: 0961.90088
DOI: 10.1016/S0304-3975(99)00125-5
author: Tomás Feder
author: Nimrod Megiddo
author: Serge Plotkin
published in: Theoretical Computer Science
publication date: 2000-08-23T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1495231
zbMATH Keywords: nonexpansive circuits
zbMATH Keywords: parallel algorithm
zbMATH Keywords: stable matching
zbMATH Keywords: primal-dual interior path-following method
zbMATH Keywords: linear programming
MaRDI profile type: Publication
cites work: Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
cites work: Q3995616
cites work: A polynomial-time algorithm for a class of linear complementarity problems
cites work: The complexity of circuit value and network stability
cites work: Q4206561
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: A New Approach to Stable Matching Problems
Wikidata QID: Q126382620
full work available at URL: s0304-3975(99)00125-5
OpenAlex ID: W2066306418
description: scientific article; zbMATH DE number 1495231