Dynamic LCA queries on trees (1999)
Cached
Download Links
- [eprints.iisc.ernet.in]
- [drona.csa.iisc.ernet.in]
- DBLP
Other Repositories/Bibliography
by
Richard Cole
,
Ramesh Hariharan
| Venue: | SIAM Journal on Computing |
| Citations: | 40 - 0 self |
BibTeX
@INPROCEEDINGS{Cole99dynamiclca,
author = {Richard Cole and Ramesh Hariharan},
title = {Dynamic LCA queries on trees},
booktitle = {SIAM Journal on Computing},
year = {1999},
pages = {235--244}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We show how to maintain a data structure on trees which allows for the following operations, all in worst-case constant time: 1. insertion of leaves and internal nodes, 2. deletion of leaves, 3. deletion of internal nodes with only one child, 4. determining the least common ancestor of any two nodes. We also generalize the Dietz–Sleator “cup-filling ” scheduling methodology, which may be of independent interest.
