Algorithms solving the matching cut problem (Q897900)

From MaRDI portal
Revision as of 04:46, 11 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
Algorithms solving the matching cut problem
scientific article

    Statements

    title
    Algorithms solving the matching cut problem (English)
    0 references
    author
    Dieter Kratsch
    0 references
    Van Bang Le
    0 references
    publication date
    8 December 2015
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C69
    0 references
    05C70
    0 references
    05C85
    0 references
    zbMATH DE Number
    6517449
    0 references
    zbMATH Keywords
    matching cut
    0 references
    graph algorithm
    0 references
    OpenAlex ID
    W2190210389
    0 references
    cites work
    Q4393307
    0 references
    Q4904144
    0 references
    Q5710169
    0 references
    Q4448767
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q897900&oldid=36217009"
    Powered by MediaWiki