Finding least common ancestors in directed acyclic graphs.

Michael A. Bender, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin

Browse the full SODA paper archive.