Login / Signup
Faster algorithms for finding lowest common ancestors in directed acyclic graphs.
Artur Czumaj
Miroslaw Kowaluk
Andrzej Lingas
Published in:
Theor. Comput. Sci. (2007)
Keyphrases
</>
directed acyclic graph
learning algorithm
probabilistic model
graph cuts
conditional independence