Faster algorithms for finding lowest common ancestors in directed acyclic graphs

Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas. Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Theoretical Computer Science, 380(1-2):37-46, 2007. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: