A scalable approach to computing representative lowest common ancestor in directed acyclic graphs

From MaRDI portal

(Redirected from A scalable approach to computing representative lowest common ancestor in directed acyclic graphs)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_scalable_approach_to_computing_representative_lowest_common_ancestor_in_directed_acyclic_graphs&oldid=77777747"