Results 11 -
11 of
11
www.elsevier.com/locate/tcs The Level Ancestor Problem simpli ed
, 2003
"... We present a simple algorithm for the Level Ancestor Problem. ALevel Ancestor Query LA(v; d) requests the depth d ancestor of node v. The Level Ancestor Problem is to preprocess a given rooted tree T to support level ancestor queries. While optimal solutions to this problem already exist, our new op ..."
Abstract
- Add to MetaCart
We present a simple algorithm for the Level Ancestor Problem. ALevel Ancestor Query LA(v; d) requests the depth d ancestor of node v. The Level Ancestor Problem is to preprocess a given rooted tree T to support level ancestor queries. While optimal solutions to this problem already exist, our new optimal solution is simple enough to be taught and implemented. c ○ 2003 Elsevier B.V. All rights reserved.
