Sequential and parallel algorithms for minimum flows. (Q1880468): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Recent Advances in Network Flows / rank
 
Normal rank
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: 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: A parallel algorithm for finding a blocking flow in an acyclic network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n2log n) parallel max-flow algorithm / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02935746 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014993890 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:56, 30 July 2024

scientific article
Language Label Description Also known as
English
Sequential and parallel algorithms for minimum flows.
scientific article

    Statements

    Sequential and parallel algorithms for minimum flows. (English)
    0 references
    0 references
    0 references
    0 references
    28 September 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    network flow
    0 references
    network algorithms
    0 references
    minimum flow problem
    0 references
    parallel algorithms
    0 references
    0 references