Implementing Goldberg's max-flow-algorithm ? A computational investigation (Q4207771): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57407476, #quickstatements; #temporary_batch_1709732266787 |
ReferenceBot (talk | contribs) Changed an Item |
||
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: Q5624995 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximal Flow Through a Network / 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: 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 |
Latest revision as of 11:03, 20 June 2024
scientific article; zbMATH DE number 4128640
Language | Label | Description | Also known as |
---|---|---|---|
English | Implementing Goldberg's max-flow-algorithm ? A computational investigation |
scientific article; zbMATH DE number 4128640 |
Statements
Implementing Goldberg's max-flow-algorithm ? A computational investigation (English)
0 references
1989
0 references
Goldberg-Tarjan algorithm
0 references
maximum flow
0 references