A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking.
Hajo BroersmaTon KloksDieter KratschHaiko MüllerPublished in: WG (1998)
Keyphrases
- np hard
- dynamic programming
- detection algorithm
- spanning tree
- cost function
- space complexity
- optimal solution
- undirected graph
- expectation maximization
- graph structure
- convergence rate
- combinatorial optimization
- learning algorithm
- simulated annealing
- k means
- search space
- segmentation algorithm
- matching algorithm
- particle swarm optimization
- linear programming
- worst case
- minimum spanning tree