Login / Signup

Maximizing the Number of Spanning Trees in a Connected Graph.

Huan LiStacy PattersonYuhao YiZhongzhi Zhang
Published in: IEEE Trans. Inf. Theory (2020)
Keyphrases
  • spanning tree
  • undirected graph
  • small number
  • connected components
  • minimum spanning tree
  • connected graphs
  • edge disjoint
  • computational complexity
  • random walk
  • minimum cost
  • data sets
  • knn
  • graph theory
  • minimum weight