Revisiting a simple algorithm for the planar multiterminal cut problem (Q991478)

From MaRDI portal
Revision as of 11:30, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Revisiting a simple algorithm for the planar multiterminal cut problem
scientific article

    Statements

    title
    Revisiting a simple algorithm for the planar multiterminal cut problem (English)
    0 references
    author
    Kevin K. H. Cheung
    0 references
    Kyle Harvey
    0 references
    publication date
    7 September 2010
    0 references
    zbMATH Keywords
    planar graph
    0 references
    multiterminal cut
    0 references
    algorithm
    0 references
    counterexample
    0 references

    Identifiers

    zbMATH DE Number
    5780115
    0 references
    OpenAlex ID
    W2037455685
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q991478&oldid=38568237"
    Powered by MediaWiki