Login / Signup

An upper bound for the number of Eulerian orientations of a regular graph.

Michel Las Vergnas
Published in: Comb. (1990)
Keyphrases
  • upper bound
  • small number
  • maximum number
  • lower bound
  • graph theory
  • real time
  • database
  • machine learning
  • multiscale
  • connected components
  • directed acyclic graph
  • polynomial time complexity