Finding least common ancestors in directed acyclic graphs

Michael A. Bender, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin. Finding least common ancestors in directed acyclic graphs. In SODA. pages 845-854, 2001. [doi]

Abstract

Abstract is missing.