A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs.
Bertrand CuissartJean-Jacques HébrardPublished in: GbRPR (2005)
Keyphrases
- detection algorithm
- computational complexity
- probabilistic model
- objective function
- preprocessing
- k means
- search space
- dynamic programming
- graph structure
- graph model
- similarity measure
- adjacency graph
- np hard
- spanning tree
- graph theory
- worst case
- undirected graph
- subgraph mining
- directed graph
- matching algorithm
- clustering method
- optimization algorithm
- genetic algorithm
- computational cost
- cost function
- learning algorithm