Finding All Breadth First Full Spanning Trees in a Directed Graph.
Hoda KhalilYvan LabichePublished in: COMPSAC (2) (2017)
Keyphrases
- directed graph
- spanning tree
- edge disjoint
- undirected graph
- strongly connected
- random walk
- total length
- minimum spanning tree
- minimum cost
- edge weights
- minimum total cost
- maximum flow
- graph properties
- graph structure
- minimum spanning trees
- weighted graph
- graph structures
- directed edges
- source node
- leaf nodes
- web graph
- directed acyclic graph