An O(\(n\)) time algorithm for maximum matching on cographs (Q685476)

From MaRDI portal
Revision as of 09:33, 22 May 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
An O(\(n\)) time algorithm for maximum matching on cographs
scientific article

    Statements

    title
    An O(\(n\)) time algorithm for maximum matching on cographs (English)
    0 references
    author
    Ming-Shing Yu
    0 references
    Cheng-Hsing Yang
    0 references
    publication date
    17 October 1993
    0 references
    zbMATH Keywords
    maximum matching
    0 references
    cographs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68R10
    0 references
    68P05
    0 references
    zbMATH DE Number
    417391
    0 references
    OpenAlex ID
    W1966596093
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q685476&oldid=34110445"
    Powered by MediaWiki