Title: Creating minimal vertex series parallel graphs from directed acyclic graphs
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.
Publication Year: 2004
Publication Date: 2004-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 12
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot