Creating minimal vertex series parallel graphs from directed acyclic graphs

Authors:
Margaret Mitchell
Affiliations:
Macquarie University, Sydney, Australia
Venue:
APVis '04 Proceedings of the 2004 Australasian symposium on Information Visualisation - Volume 35
Year:
2004

Citing 4
Cited 3

Parallel recognition of series-parallel graphs

Information and Computation
Use of directed acyclic graph analysis in generating instructions for multiple users

APVis '01 Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9
Parallel Algorithms for Series Parallel Graphs

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
A new algorithm for the recognition of series parallel graphs

A new algorithm for the recognition of series parallel graphs

Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality

IEEE Transactions on Parallel and Distributed Systems
Area-maximizing schedules for series-parallel DAGs

Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Assessing the computational benefits of AREA-oriented DAG-scheduling

Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.