An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree

Details An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree

2009-01-19

arxiv.org/abs/0901.2900v1

Computer Science

Data Structures and Algorithms

Scientific paper

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: $O(n(log(n)))$ to build the Top-tree. 2. Update Time: $O(log(n))$ 3. Query Time: O(1) to query the cardinality of maximum-matching and $O(log(n))$ to find if a particular edge is matched.

Affiliated with

Also associated with

No associations

Rating

An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-567029