Melanie Coggan

Learn More
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2;E), where the maximum degree of vertices in V2 is 4, can G be embedded on a two dimensional grid such that each vertex in V1 is drawn as a line segment along a grid line, each vertex in V2 is drawn as a point at a grid point, and each edge e = (u, v) for(More)
  • 1