A novel way to formalize stable graph cores by using matching-graphs.
Mathias FuchsKaspar RiesenPublished in: Pattern Recognit. (2022)
Keyphrases
- graph matching
- maximum cardinality
- subgraph isomorphism
- association graph
- graph matching algorithm
- graph representation
- adjacency matrix
- bipartite graph
- directed graph
- graph structure
- attributed relational graph
- graph databases
- weighted graph
- graph model
- labeled graphs
- inexact graph matching
- graph theory
- graph partitioning
- graph clustering
- graph construction
- graph mining
- graph classification
- maximum clique
- matching algorithm
- series parallel
- maximum weight
- graph theoretic
- pattern matching
- attributed graphs
- graph theoretical
- graph kernels
- finding the shortest path
- maximum common subgraph
- graph structures
- graph properties
- graph isomorphism
- structural pattern recognition
- graph search
- relational structures
- edit distance
- minimum weight
- spanning tree
- undirected graph
- graph representations
- random graphs
- graph transformation
- graph data
- graph embedding
- graph layout
- disk resident
- dynamic graph
- maximal cliques
- image matching
- real world graphs
- small world
- average degree
- graph patterns
- edge weights
- neighborhood graph
- random walk
- massive graphs
- quasi cliques
- planar graphs
- link prediction
- structured data