Counting spanning trees using modular decomposition.
Stavros D. NikolopoulosLeonidas PaliosCharis PapadopoulosPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- spanning tree
- edge disjoint
- minimum spanning tree
- minimum cost
- minimum spanning trees
- minimum weight
- undirected graph
- decomposition method
- minimum total cost
- lowest cost
- modular structure
- root node
- decomposition algorithm
- image decomposition
- decomposition methods
- high dimensional
- wavelet packet
- weighted graph
- semi supervised