An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree
| dc.creator | Gupta, Manoj | |
| dc.creator | Sharma, Ankit | |
| dc.date | 2009-01-19 | |
| dc.date.accessioned | 2026-07-07T12:31:39Z | |
| dc.date.available | 2026-07-07T12:31:39Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0901.2900 | |
| dc.identifier | http://arxiv.org/abs/0901.2900 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/216517 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | An O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree | |
| dc.type | text |