Login / Signup

A Bound on the Number of Edges in Graphs Without an Even Cycle.

Boris BukhZilin Jiang
Published in: Comb. Probab. Comput. (2017)
Keyphrases
  • small number
  • undirected graph
  • computational complexity
  • directed graph
  • memory requirements
  • bayesian networks
  • multiscale
  • upper bound
  • fixed number