The maximum flow problem: A max-preflow approach (Q811325): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NETGEN / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(91)90060-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066919504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040780 / 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: Dual coordinate step methods for linear network flow problems / 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: Implementing Goldberg's max-flow-algorithm ? A computational investigation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / 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: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling algorithms for network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(EV\log^2V)\) algorithm for the maximal flow problem / 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 primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202489 / 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 data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple version of Karzanov's blocking flow algorithm / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:22, 24 June 2024

scientific article
Language Label Description Also known as
English
The maximum flow problem: A max-preflow approach
scientific article

    Statements

    The maximum flow problem: A max-preflow approach (English)
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    0 references
    maximum preflow
    0 references
    flow push paths
    0 references
    0 references