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...
The study of evolution of networks has received increased interest with the recent discovery that many real-world networks possess many things in common, in particular the manner ...
Anurat Chapanond, Mukkai S. Krishnamoorthy, G. M. ...
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...