A Depth-first Algorithm to Reduce Graphs in Linear Time.
Miklós BarthaMiklós KrészPublished in: SYNASC (2009)
Keyphrases
- worst case
- search space
- learning algorithm
- detection algorithm
- segmentation algorithm
- dynamic programming
- np hard
- cost function
- matching algorithm
- computational cost
- minimum spanning tree
- preprocessing
- search strategy
- objective function
- adjacency graph
- simulated annealing
- expectation maximization
- optimization algorithm
- similarity measure
- spanning tree
- maximum common subgraph
- graph clustering
- neural network
- graph structure
- k means
- computational complexity
- optimal solution
- genetic algorithm