On finding lowest common ancestors: simplification and parallelization

We consider the following problem. Suppose a rooted tree $T$ is available for preprocessing. Answer on-line queries requesting the lowest common ancestor for any pair of vertices in $T$. We present a linear time and space preprocessing algorithm that enables us to answer each query in $O(1)$ time, a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on computing 1988-12, Vol.17 (6), p.1253-1262
Hauptverfasser:	SCHIEBER, B, VISHKIN, U
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Applied mathematics Applied sciences Computer science control theory systems Exact sciences and technology Queries Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!