Home  Issues  Aims and Scope  Instructions for Authors 
DOI: 10.7155/jgaa.00161
Drawing Bipartite Graphs on Two Parallel Convex Curves
Vol. 12, no. 1, pp. 97112, 2008. Regular paper.
Abstract 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 straightline drawing such that the vertices of one partite set of G lie on λ_{e} and the vertices of the
other partite set lie on λ_{i}. A characterization is presented that gives rise to linear time testing algorithm. We also
describe a drawing algorithm that runs in linear time if the curves are two concentric circles and the real RAM model of computation
is adopted.

Submitted: December 2006.
Revised: September 2007.
