Fetching the paper…

Reading the bibliography…

2009

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

Gupta, Manoj, Sharma, Ankit

Original
PDF
Post on X

Understand

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.

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

Built on

Nothing clear enough to list yet.

Similar

Nothing clear enough to list yet.

Then

Nothing clear enough to list yet.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…