A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph.
Richard A. DukeHanno LefmannVojtech RödlPublished in: SIAM J. Comput. (1995)
Keyphrases
- graph based algorithm
- learning algorithm
- detection algorithm
- dynamic programming
- similarity measure
- dominating set
- preprocessing
- graph structure
- np hard
- worst case
- matching algorithm
- clustering method
- homology generators
- weighted graph
- segmentation algorithm
- k means
- search space
- data structure
- simulated annealing
- tree structure
- markov random field
- approximation algorithms
- graph mining
- graph model
- subgraph isomorphism
- lower bound
- objective function