A Data Structure for Dynamically Maintaining Rooted Trees

DOI10.1006/jagm.1996.0835zbMath0882.68104OpenAlexW2025791989MaRDI QIDQ4349698

Greg N. Frederickson

Publication date: 25 August 1997

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1986&context=cstech

zbMATH Keywords

directed topology tree data structure

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (6)

Succinct indices for path minimum, with applications ⋮ LS(graph): a constraint-based local search for constraint optimization on trees and paths ⋮ A consistent semantics of self-adjusting computation ⋮ Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs ⋮ Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies ⋮ Dynamic path queries in linear space

This page was built for publication: A Data Structure for Dynamically Maintaining Rooted Trees