A shorter proof of the graph minor algorithm: the unique linkage theorem.
Ken-ichi KawarabayashiPaul WollanPublished in: STOC (2010)
Keyphrases
- learning algorithm
- dynamic programming
- detection algorithm
- preprocessing
- computational cost
- simulated annealing
- experimental evaluation
- cost function
- search space
- probabilistic model
- spanning tree
- optimization algorithm
- recognition algorithm
- times faster
- matching algorithm
- minimum spanning tree
- dominating set
- depth first search
- graph model
- graph structure
- graph based algorithm
- optimal solution
- objective function
- ant colony optimization
- graph matching
- clustering method
- expectation maximization
- graphical models
- high accuracy
- graph partitioning
- significant improvement
- computational complexity
- maximum flow
- graph theoretical