Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427)

From MaRDI portal
Revision as of 12:02, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
scientific article

    Statements

    Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (English)
    0 references
    0 references
    1 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    maximal matching
    0 references
    path matching
    0 references
    counting
    0 references
    clique-width
    0 references
    0 references
    0 references