Faster Enumeration of All Spanning Trees of a Directed Graph.
Ramesh HariharanSanjiv KapoorVijay KumarPublished in: WADS (1995)
Keyphrases
- directed graph
- spanning tree
- undirected graph
- edge disjoint
- random walk
- minimum spanning tree
- minimum cost
- minimum spanning trees
- edge weights
- search space
- strongly connected
- directed acyclic graph
- leaf nodes
- directed edges
- minimum total cost
- shortest path problem
- maximum flow
- disjoint paths
- weighted graph
- wireless sensor networks
- special case