Dynamic LCA queries on trees

Richard Cole, Ramesh Hariharan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We show how to maintain 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.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Editors Anon
PublisherSIAM
Pages235-244
Number of pages10
StatePublished - 1999
EventProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA
Duration: Jan 17 1999Jan 19 1999

Other

OtherProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms
CityBaltimore, MD, USA
Period1/17/991/19/99

Fingerprint

Data structures
Query
Deletion
Leaves
Vertex of a graph
Internal
Time Constant
Insertion
Data Structures
Children

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Discrete Mathematics and Combinatorics

Cite this

Cole, R., & Hariharan, R. (1999). Dynamic LCA queries on trees. In Anon (Ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 235-244). SIAM.

Dynamic LCA queries on trees. / Cole, Richard; Hariharan, Ramesh.

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Anon. SIAM, 1999. p. 235-244.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cole, R & Hariharan, R 1999, Dynamic LCA queries on trees. in Anon (ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp. 235-244, Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, 1/17/99.
Cole R, Hariharan R. Dynamic LCA queries on trees. In Anon, editor, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM. 1999. p. 235-244
Cole, Richard ; Hariharan, Ramesh. / Dynamic LCA queries on trees. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. editor / Anon. SIAM, 1999. pp. 235-244
@inproceedings{b628d018d2cb402a9d69250471d4523d,
title = "Dynamic LCA queries on trees",
abstract = "We show how to maintain 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.",
author = "Richard Cole and Ramesh Hariharan",
year = "1999",
language = "English (US)",
pages = "235--244",
editor = "Anon",
booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "SIAM",

}

TY - GEN

T1 - Dynamic LCA queries on trees

AU - Cole, Richard

AU - Hariharan, Ramesh

PY - 1999

Y1 - 1999

N2 - We show how to maintain 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.

AB - We show how to maintain 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.

UR - http://www.scopus.com/inward/record.url?scp=0032785554&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032785554&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0032785554

SP - 235

EP - 244

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

A2 - Anon, null

PB - SIAM

ER -