Iterative Creation of Matching-Graphs - Finding Relevant Substructures in Graph Sets.
Mathias FuchsKaspar RiesenPublished in: CIARP (2021)
Keyphrases
- finding relevant
- graph matching
- graph mining
- graph databases
- graph data
- subgraph isomorphism
- maximum cardinality
- bipartite graph matching
- graph matching algorithm
- bipartite graph
- adjacency matrix
- inexact graph matching
- association graph
- graph representation
- graph structures
- graph theory
- matching algorithm
- weighted graph
- attributed relational graph
- frequent subgraphs
- graph search
- substructure discovery
- graph clustering
- graph structure
- graph isomorphism
- labeled graphs
- structured data
- connected components
- series parallel
- real world graphs
- directed graph
- graph classification
- pattern mining
- graph theoretical
- entity search
- attributed graphs
- maximum clique
- graph patterns
- random graphs
- graph theoretic
- graph model
- regular expressions
- maximum common subgraph
- graph construction
- graph partitioning
- maximum weight
- community detection
- image matching
- structural pattern recognition
- graph properties
- graph transformation
- dense subgraphs
- query graph
- structural patterns
- planar graphs
- evolving graphs
- edge weights
- spanning tree
- data structure
- directed acyclic
- connected dominating set
- reachability queries
- dynamic graph
- adjacency graph
- graph embedding
- neighborhood graph
- graph kernels
- web graph
- undirected graph
- link prediction
- random walk