Efficiently drawing a significant spanning tree of a directed graph.
Martin HarriganPatrick HealyPublished in: APVIS (2007)
Keyphrases
- directed graph
- spanning tree
- undirected graph
- edge weights
- random walk
- minimum spanning tree
- directed acyclic graph
- minimum weight
- maximum flow
- minimum spanning trees
- edge disjoint
- minimum cost
- shortest path problem
- strongly connected
- weighted graph
- graph structures
- approximation algorithms
- disjoint paths
- leaf nodes
- graph structure
- complex networks
- directed edges
- dynamic programming