The graph matching problem (Q2444585)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The graph matching problem
scientific article

    Statements

    title
    The graph matching problem (English)
    0 references
    author
    Lorenzo Livi
    0 references
    Antonello Rizzi
    0 references
    publication date
    10 April 2014
    0 references
    zbMATH Keywords
    graph-based pattern recognition
    0 references
    inexact graph matching
    0 references
    graph edit distance
    0 references
    graph kernels
    0 references
    graph embedding
    0 references
    describes a project that uses
    CloseGraph
    0 references
    gSpan
    0 references
    cites work
    Q4450795
    0 references
    Q3755956
    0 references
    Q5191310
    0 references
    Q4398864
    0 references
    Q4821526
    0 references
    Mining Graph Data
    0 references
    Q2756784
    0 references
    Q4139463
    0 references
    Q4198056
    0 references
    Q4071270
    0 references
    Q4828516
    0 references
    Q4148000
    0 references
    Q4523707
    0 references
    Q2880991
    0 references
    Self-organizing maps.
    0 references
    Q3093231
    0 references
    Q5528329
    0 references
    Q3093199
    0 references
    Q4485837
    0 references
    Q5491447
    0 references
    Q4808933
    0 references
    Q2755103
    0 references
    Q3378484
    0 references
    Q2896075
    0 references
    Q4397004
    0 references
    Q4266131
    0 references
    Fuzzy sets
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C70
    0 references
    68T10
    0 references
    zbMATH DE Number
    6282315
    0 references
    Wikidata QID
    Q57921782
    0 references
    OpenAlex ID
    W2003627696
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2444585&oldid=39626791"
    Powered by MediaWiki