Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (Q1692069)

From MaRDI portal
Revision as of 00:09, 15 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
Polynomial time algorithms for variants of graph matching on partial \(k\)-trees
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references