The binary network flow problem is logspace complete for P (Q914388)

From MaRDI portal
Revision as of 16:45, 20 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The binary network flow problem is logspace complete for P
scientific article

    Statements

    title
    The binary network flow problem is logspace complete for P (English)
    0 references
    author
    Thomas Lengauer
    0 references
    Klaus W. Wagner
    0 references
    publication date
    1990
    0 references
    zbMATH DE Number
    4149562
    0 references
    zbMATH Keywords
    logspace complete
    0 references
    maximum flow
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q914388&oldid=34824719"
    Powered by MediaWiki