More efficient parallel flow algorithms (Q6487968): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Fast and Simple Algorithm for the Maximum Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Time Bounds for the Maximum Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Bipartite Network Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bounds for decision problems on the CRCW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved deterministic parallel integer sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Preflow Push Algorithms for Maximum Network Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic coin tossing with applications to optimal parallel list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processor-efficient implementation of a maximum flow algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum-Cost Circulations by Successive Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Deterministic Processor Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining discrete probability distributions optimally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3313267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n2log n) parallel max-flow algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel blocking flow algorithm for acyclic networks / rank
 
Normal rank

Revision as of 11:52, 3 December 2024

scientific article; zbMATH DE number 7666518
Language Label Description Also known as
English
More efficient parallel flow algorithms
scientific article; zbMATH DE number 7666518

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references