Login / Signup
Faster algorithms for finding lowest common ancestors in directed acyclic graphs.
Artur Czumaj
Miroslaw Kowaluk
Andrzej Lingas
Published in:
Electron. Colloquium Comput. Complex. (2006)
Keyphrases
</>
directed acyclic graph
learning algorithm
equivalence classes
computational complexity
graphical models
structural learning