A sublinear parallel algorithm for stable matching (Q1575960): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of circuit value and network stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approach to Stable Matching Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:16, 30 May 2024

scientific article
Language Label Description Also known as
English
A sublinear parallel algorithm for stable matching
scientific article

    Statements

    A sublinear parallel algorithm for stable matching (English)
    0 references
    0 references
    0 references
    0 references
    23 August 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    nonexpansive circuits
    0 references
    parallel algorithm
    0 references
    stable matching
    0 references
    primal-dual interior path-following method
    0 references
    linear programming
    0 references