Login / Signup

k-Distinct In- and Out-Branchings in Digraphs.

Gregory Z. GutinFelix ReidlMagnus Wahlström
Published in: ICALP (2017)
Keyphrases
  • equivalence classes
  • end users
  • co occurrence
  • closely related
  • machine learning
  • high level
  • pattern recognition
  • hidden markov models
  • directed graph