Login / Signup

On a formula for the number of Euler trails for a class of digraphs.

Josef Lauri
Published in: Discret. Math. (1997)
Keyphrases
  • finite number
  • fixed number
  • multiple classes
  • data sets
  • computational complexity
  • np complete
  • computer vision