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

From MaRDI portal
Revision as of 01:16, 4 July 2023 by Importer (talk | contribs) (‎Created a new 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

    An O(\(n\)) time algorithm for maximum matching on cographs (English)
    0 references
    0 references
    0 references
    17 October 1993
    0 references
    maximum matching
    0 references
    cographs
    0 references

    Identifiers