Login / Signup

The number of spanning trees of a family of 2-separable weighted graphs.

Helin GongShuli Li
Published in: Discret. Appl. Math. (2017)
Keyphrases
  • spanning tree
  • weighted graph
  • edge weights
  • computational complexity
  • np hard
  • text classification
  • shortest path
  • minimum cost
  • minimum spanning tree
  • edge disjoint