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

From MaRDI portal
scientific article
Language Label Description Also known as
English
Polynomial time algorithms for variants of graph matching on partial \(k\)-trees
scientific article

    Statements

    Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (English)
    0 references
    0 references
    26 January 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph isomorphism with restriction
    0 references
    partial \(k\)-trees
    0 references
    polynomial time algorithm
    0 references
    0 references