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. Electronic Colloquium on Computational Complexity (ECCC), 13(111), 2006. [doi]

Abstract

Abstract is missing.