A fast discovery algorithm for large common connected induced subgraphs.
Alessio ConteRoberto GrossiAndrea MarinoLorenzo TattiniLuca VersariPublished in: Discret. Appl. Math. (2019)
Keyphrases
- dynamic programming
- learning algorithm
- preprocessing
- convergence rate
- k means
- detection algorithm
- experimental evaluation
- optimization algorithm
- theoretical analysis
- optimal solution
- times faster
- computationally efficient
- matching algorithm
- high accuracy
- np hard
- cost function
- data mining
- path planning
- image registration
- recognition algorithm
- tree structure
- improved algorithm
- segmentation algorithm
- expectation maximization
- data sets
- computational complexity
- data structure
- objective function
- neural network