Login / Signup

A limit characterization for the number of spanning trees of graphs.

Stavros D. NikolopoulosChristos NomikosPanos Rondogiannis
Published in: Inf. Process. Lett. (2004)
Keyphrases
  • spanning tree
  • computational complexity
  • undirected graph
  • small number
  • minimum spanning tree
  • minimum spanning trees
  • objective function
  • graphical models
  • minimum cost
  • random graphs
  • edge disjoint