An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree
Data Structures and Algorithms
2009-01-20 v1
Abstract
In this paper, we have developed a fully-dynamic algorithm for maintaining cardinality of maximum-matching in a tree using the construction of top-trees. The time complexities are as follows: 1. Initialization Time: to build the Top-tree. 2. Update Time: 3. Query Time: O(1) to query the cardinality of maximum-matching and to find if a particular edge is matched.
Cite
@article{arxiv.0901.2900,
title = {An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree},
author = {Manoj Gupta and Ankit Sharma},
journal= {arXiv preprint arXiv:0901.2900},
year = {2009}
}