Polynomial time algorithm for the k-in-a-tree problem on chordal graphs.
Vinícius Fernandes dos SantosMurilo V. G. da SilvaJayme Luiz SzwarcfiterPublished in: CTW (2015)
Keyphrases
- computational complexity
- minimum spanning tree
- detection algorithm
- worst case
- spanning tree
- tree structure
- preprocessing
- learning algorithm
- objective function
- polynomial time complexity
- decision trees
- undirected graph
- graph structure
- random graphs
- expectation maximization
- simulated annealing
- np hard
- k means
- optimal solution
- graph construction
- tree construction
- approximation ratio
- strongly polynomial
- matching algorithm
- linear programming
- dynamic programming
- evolutionary algorithm
- data structure
- similarity measure