The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (Q672389): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56092053 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(95)00022-o / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064332653 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:10, 30 July 2024

scientific article
Language Label Description Also known as
English
The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate
scientific article

    Statements

    The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (English)
    0 references
    0 references
    28 February 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers