Complexity results for rainbow matchings (Q2637345)

From MaRDI portal
Revision as of 07:57, 7 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
Complexity results for rainbow matchings
scientific article

    Statements

    title
    Complexity results for rainbow matchings (English)
    0 references
    author
    Van Bang Le
    0 references
    Florian Pfender
    0 references
    publication date
    11 February 2014
    0 references
    zbMATH Keywords
    rainbow matching
    0 references
    computational complexity
    0 references
    NP-completeness
    0 references
    APX-completeness
    0 references
    parameterized complexity
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W25
    0 references
    68Q25
    0 references
    05C70
    0 references
    05C35
    0 references
    05C15
    0 references
    zbMATH DE Number
    6256807
    0 references
    OpenAlex ID
    W2034652539
    0 references
    arXiv ID
    1312.7253
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2637345&oldid=35372784"
    Powered by MediaWiki