most citedLinear-Time Pointer-Machine Algorithms for Path-Evaluation Problems on Trees and Graphs

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2007

Data Structures for Mergeable Trees

Loukas Georgiadis, Haim Kaplan, Nira Shafrir +2

Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant requires merging two…

cs.DS2002★ 1 cited

Linear-Time Pointer-Machine Algorithms for Path-Evaluation Problems on Trees and Graphs

Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan +3

We present algorithms that run in linear time on pointer machines for a collection of problems, each of which either directly or indirectly requires the evaluation of a function de…