Login / Signup

Faster algorithms for finding lowest common ancestors in directed acyclic graphs.

Artur CzumajMiroslaw KowalukAndrzej Lingas
Published in: Theor. Comput. Sci. (2007)
Keyphrases
  • directed acyclic graph
  • learning algorithm
  • probabilistic model
  • graph cuts
  • conditional independence