Optimal Independent Spanning Trees on Cartesian Product of Hybrid Graphs.
Jinn-Shyong YangJou-Ming ChangPublished in: Comput. J. (2014)
Keyphrases
- spanning tree
- cartesian product
- minimum cost
- minimum spanning trees
- minimum spanning tree
- undirected graph
- edge disjoint
- minimum weight
- worst case
- np hard
- weighted graph
- dynamic programming
- graph matching
- state space
- edge weights
- optimal solution
- approximation algorithms
- graph structure
- graphical models
- lowest cost
- minimum total cost
- reinforcement learning