An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree
Manoj GuptaAnkit SharmaPublished in: CoRR (2009)
Keyphrases
- tree structure
- dynamic programming
- computational complexity
- maximum matching
- cost function
- worst case
- learning algorithm
- optimal solution
- detection algorithm
- expectation maximization
- objective function
- binary tree
- graph structure
- state space
- np hard
- k means
- preprocessing
- computational cost
- active learning
- matching algorithm
- combinatorial optimization
- search space
- randomly generated
- association rules