RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs.
John W. RaymondEleanor J. GardinerPeter WillettPublished in: Comput. J. (2002)
Keyphrases
- weighted graph
- graph properties
- graph mining
- labeled graphs
- maximum common subgraph
- graph databases
- topological information
- subgraph mining
- similarity function
- graph structures
- disjoint paths
- graph data
- undirected graph
- similarity measure
- subgraph isomorphism
- frequent subgraph mining
- directed graph
- similarity scores
- edge weights
- vertex set
- graph structure
- semantic similarity
- query graph
- similarity graph
- reachability queries
- graph theoretic
- dense subgraphs
- connected subgraphs
- frequent subgraphs
- edge detection
- graph representation
- subgraph matching
- normalized cut
- graph model
- connected components
- maximum clique
- maximal cliques
- inexact graph matching
- distance measure
- graph theory
- data structure
- edit distance
- random walk
- graph clustering
- similarity metric
- structured data
- edge information
- strongly connected
- graph patterns
- d objects
- pairwise
- distance function
- euclidean distance
- directed acyclic graph
- image segmentation