Using a Significant Spanning Tree to Draw a Directed Graph.

Martin Harrigan Patrick Healy

Published in: J. Graph Algorithms Appl. (2008)

Keyphrases

directed graph
spanning tree
undirected graph
random walk
edge weights
minimum weight
minimum spanning tree
minimum spanning trees
shortest path problem
minimum cost
directed acyclic graph
graph structure
leaf nodes
disjoint paths
maximum flow
strongly connected
edge disjoint
web graph
multimedia
minimum total cost