Routing flow through a strongly connected graph (Q1348945): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/s00453-001-0082-y / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S00453-001-0082-Y / rank
 
Normal rank

Latest revision as of 18:34, 10 December 2024

scientific article
Language Label Description Also known as
English
Routing flow through a strongly connected graph
scientific article

    Statements

    Routing flow through a strongly connected graph (English)
    0 references
    0 references
    21 May 2002
    0 references
    binary blocking flow algorithm
    0 references
    0 references
    0 references

    Identifiers