Dynamic LCA queries on trees

Richard Cole, Ramesh Hariharan

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)894-923
Number of pages30
JournalSIAM Journal on Computing
Volume34
Issue number4
DOIs
StatePublished - Sep 13 2005

Keywords

  • "cup-filling" scheduling
  • Dynamic LCA
  • LCA

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Dynamic LCA queries on trees'. Together they form a unique fingerprint.

  • Cite this