3 search results - page 1 / 1 » Drawing Bipartite Graphs on Two Parallel Convex Curves |
JGAA
2008
13 years 4 months ago
2008
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
GD
2003
Springer
13 years 9 months ago
2003
Springer
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...
COCOA
2007
Springer
13 years 10 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...