A local branching heuristic for solving a graph edit distance problem (Q1734846)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A local branching heuristic for solving a graph edit distance problem
scientific article

    Statements

    A local branching heuristic for solving a graph edit distance problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph edit distance
    0 references
    graph matching
    0 references
    local branching heuristic
    0 references
    0 references