Computational investigations of maximum flow algorithms (Q1278652): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
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: Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Use of Representative Operation Counts in Computational Testing of Algorithms / 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: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating pseudo-random permutations and maximum flow algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4283436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An auction algorithm for the max-flow problem / 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: On implementing the push-relabel method for the maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Comparison of Eight Methods for the Maximum Network Flow Problem / 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: Maximal Flow Through a Network / 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: Toward a Programming Environment for Combinatorial Optimization: A Case Study Oriented to Max-Flow Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal simplex variant for the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Use of dynamic trees in a network simplex algorithm for the maximum 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: On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical investigations on the maximal flow algorithm of Karzanov / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE PRACTICAL EFFICIENCY OF VARIOUS MAXIMUM FLOW ALGORITHMS / 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: The maximum flow problem: A max-preflow approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4283435 / 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 / Wikidata QID
 
Property / Wikidata QID: Q29028602 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(96)00269-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051022544 / rank
 
Normal rank

Latest revision as of 09:24, 30 July 2024

scientific article
Language Label Description Also known as
English
Computational investigations of maximum flow algorithms
scientific article

    Statements

    Computational investigations of maximum flow algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 February 1999
    0 references
    computational comparisons
    0 references
    maximum flow
    0 references
    augmenting path algorithms
    0 references
    capacity-scaling algorithm
    0 references
    preflow-push algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers