Implementing Goldberg's max-flow-algorithm ? A computational investigation (Q4207771): 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 / Wikidata QID
 
Property / Wikidata QID: Q57407476 / 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: 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
links / mardi / namelinks / mardi / name
 

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

    Identifiers

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