Visualizing information whose underlying graph is directed acyclic is easier if the graph is Minimal Vertex Series Parallel (MVSP). We present method of transforming any directed acyclic graph into one that is MVSP. This enables an easy visualization of the information contained in the original graph. We illustrate this by an example of a schedule that contains
parallelism.
Cite as: Mitchell, M. (2004). Creating Minimal Vertex Series Parallel Graphs from Directed Acyclic Graphs.. In Proc. Australasian Symposium on Information Visualisation, (invis.au'04), Christchurch, New Zealand. CRPIT, 35. Churcher, N. and Churcher, C., Eds. ACS. 133-139.
(from crpit.com)
(local if available)