Enumeration of Spanning Trees Using Edge Exchange with Minimal Partitioning.
Nasr MohamedPublished in: CoRR (2014)
Keyphrases
- spanning tree
- minimum spanning trees
- undirected graph
- weighted graph
- edge weights
- minimum spanning tree
- edge disjoint
- vertex set
- minimum cost
- graph partitioning
- edge detection
- edge information
- search space
- information exchange
- dynamic programming
- depth first search
- root node
- minimum total cost
- knn
- partitioning algorithm
- image processing