Login / Signup

Vulnerability bounds on the number of spanning tree leaves.

Gábor Salamon
Published in: Ars Math. Contemp. (2009)
Keyphrases
  • spanning tree
  • lower bound
  • special case
  • markov chain
  • undirected graph
  • upper bound
  • small number
  • simulated annealing
  • directed acyclic graph
  • minimum cost