Finding least common ancestors in directed acyclic graphs

Full Text:

Pdf

Authors:	Michael A. Bender	State University of New York at Stony Brook, Stony Brook, NY
	Giridhar Pemmasani	State University of New York at Stony Brook, Stony Brook, NY
	Steven Skiena	State University of New York at Stony Brook, Stony Brook, NY
	Pavel Sumazin	State University of New York at Stony Brook, Stony Brook, NY

	2001 Article
Bibliometrics
· Downloads (6 Weeks): 4 · Downloads (12 Months): 29 · Citation Count: 6

Published in:

· Proceeding

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Tools and Resources