Cole, Richard and Hariharan, Ramesh (2005) Dynamic LCA Queries on Trees. In: SIAM Journal on Computing, 34 (4). pp. 894-923.
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.
|Item Type:||Journal Article|
|Additional Information:||The DOI is currently only displayed. The copyright for this article belongs to SIAM publications.|
|Keywords:||LCA;dynamic LCA;"cup-filling" scheduling|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||13 Jul 2005|
|Last Modified:||19 Sep 2010 04:19|
Actions (login required)