Sciweavers

APVIS
2004
14 years 29 days ago
Creating Minimal Vertex Series Parallel Graphs from Directed Acyclic Graphs
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 ...
Margaret Mitchell
GD
2007
Springer
14 years 5 months ago
Line Crossing Minimization on Metro Maps
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...