%S Lecture notes in Computer Science
%A Emilio Di Giacomo
%A Luca Grilli
%A Giuseppe Liotta
%T Drawing Bipartite Graphs on Two Curves
%X Let G be a bipartite graph, and let $\lambda_e,\lambda_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 partite set of G lie on $\lambda_e$ and the vertices of the
other partite set lie on $\lambda_i$. A characterization is
presented that gives rise to linear time testing and drawing
algorithms.
    
%P 380-385
%E Michael Kaufmann
%E Dorothea Wagner
%D 2007
%I Springer
%L gdea_3793