A simpler algorithm and shorter proof for the graph minor decomposition.
Ken-ichi KawarabayashiPaul WollanPublished in: STOC (2011)
Keyphrases
- matching algorithm
- ant colony optimization
- cost function
- experimental evaluation
- similarity measure
- graph based algorithm
- probabilistic model
- shortest path problem
- detection algorithm
- learning algorithm
- preprocessing
- dynamic programming
- high accuracy
- np hard
- maximum flow
- optimal solution
- graph structure
- depth first search
- breadth first search
- expectation maximization
- graph connectivity
- undirected graph
- np complete
- computational cost
- significant improvement
- decision trees