Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication

Miroslaw Kowaluk, Andrzej Lingas. Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication. In Lars Arge, Michael Hoffmann, Emo Welzl, editors, Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings. Volume 4698 of Lecture Notes in Computer Science, pages 265-274, Springer, 2007. [doi]

Abstract

Abstract is missing.