Parallel algorithms for the assignment and minimum-cost flow problems (Q1319670): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59592645 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling algorithms for network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Scaling Algorithms for Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3352816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a perfect matching is in random NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(93)90068-r / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2118684575 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:23, 30 July 2024

scientific article
Language Label Description Also known as
English
Parallel algorithms for the assignment and minimum-cost flow problems
scientific article

    Statements

    Parallel algorithms for the assignment and minimum-cost flow problems (English)
    0 references
    0 references
    0 references
    12 April 1994
    0 references
    0 references
    parallel algorithm
    0 references
    scaling
    0 references
    assignment problem
    0 references
    bipartite matching
    0 references
    minimum-cost flow
    0 references
    0 references
    0 references