Drawing Bipartite Graphs on Two Parallel Convex Curves

Authors

  • Emilio Di Giacomo
  • Luca Grilli
  • Giuseppe Liotta

DOI:

https://doi.org/10.7155/jgaa.00161

Abstract

Let G be a bipartite graph, and let λei 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 λ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.

Downloads

Downloads

Published

2008-01-01

How to Cite

Di Giacomo, E., Grilli, L., & Liotta, G. (2008). Drawing Bipartite Graphs on Two Parallel Convex Curves. Journal of Graph Algorithms and Applications, 12(1), 97–112. https://doi.org/10.7155/jgaa.00161