Enumerating all connected maximal common subgraphs in two graphs.
Ina KochPublished in: Theor. Comput. Sci. (2001)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- subgraph matching
- labeled graphs
- connected subgraphs
- graph properties
- connected components
- subgraph mining
- reachability queries
- graph data
- maximum common subgraph
- graph structures
- graph matching
- frequent subgraph mining
- frequent subgraphs
- independent set
- maximum clique
- query graph
- graph theory
- biological networks
- graph patterns
- graph clustering
- connected graphs
- neighborhood graph
- topological information
- graph theoretic
- graph representation
- graph partitioning
- weighted graph
- dense subgraphs
- graph search
- polynomial delay
- quasi cliques
- structured data
- complex structures
- graph model
- bipartite graph
- link prediction
- pattern mining