Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

APVIS
2004

favoriteEmaildiscussreport

106views Information Technology» more APVIS 2004»

Creating Minimal Vertex Series Parallel Graphs from Directed Acyclic Graphs

13 years 6 months ago

Creating Minimal Vertex Series Parallel Graphs from Directed Acyclic Graphs

Download crpit.com

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.

Margaret Mitchell

Real-time Traffic

APVIS 2004 | APVIS 2007 | Directed Acyclic Graph | Minimal Vertex Series | Underlying Graph |

claim paper

Related Content

» Solving the feedback vertex set problem on undirected graphs

» Decentralized Search with Random Costs

» Elastic Partial Matching of Time Series

» Large graph processing in the cloud

» Minimum number of wavelengths equals load in a DAG without internal cycle

» Upward ThreeDimensional Grid Drawings of Graphs

» A distributed placement service for graphstructured and treestructured data

» A lightweight flowbased toolkit for parallel and distributed bioinformatics pipelines

» A Unified Resource Scheduling Framework for Heterogeneous Computing Environments

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2004
Where	APVIS
Authors	Margaret Mitchell

Comments (0)