An Algorithm for Enumerating All Spanning Trees of a Directed Graph.
Sanjiv KapoorH. RameshPublished in: Algorithmica (2000)
Keyphrases
- spanning tree
- directed graph
- learning algorithm
- undirected graph
- minimum spanning tree
- times faster
- computational complexity
- k means
- worst case
- maximum flow
- shortest path problem
- graph structure
- dynamic programming
- np hard
- optimal solution
- search space
- objective function
- ant colony optimization
- random walk
- upper bound
- search algorithm