A paradigm for listing \((s,t)\)-cuts in graphs (Q1911466)

From MaRDI portal
Revision as of 05:13, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A paradigm for listing \((s,t)\)-cuts in graphs
scientific article

    Statements

    title
    A paradigm for listing \((s,t)\)-cuts in graphs (English)
    0 references
    author
    J. Scott Provan
    0 references
    Douglas R. Shier
    0 references
    published in
    Algorithmica
    0 references
    publication date
    13 August 1996
    0 references
    zbMATH Keywords
    enumeration
    0 references
    time-per-cut complexity
    0 references

    Identifiers

    zbMATH DE Number
    871312
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1911466&oldid=26592171"
    Powered by MediaWiki