Maximum reachability preserved graph cut (Q2202008)

From MaRDI portal
Revision as of 15:02, 23 July 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
Maximum reachability preserved graph cut
scientific article

    Statements

    title
    Maximum reachability preserved graph cut (English)
    0 references
    author
    Dongjing Miao
    0 references
    Jian-Zhong Li
    0 references
    Zhipeng Cai
    0 references
    publication date
    17 September 2020
    0 references
    zbMATH Keywords
    reachability-preserved cut
    0 references
    multiway cut
    0 references
    complexity analysis
    0 references
    hardness
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    7248842
    0 references
    OpenAlex ID
    W3081683235
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2202008&oldid=36617982"
    Powered by MediaWiki