436 search results - page 23 / 88 » Lombardi Drawings of Graphs |
121
Voted
GD
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the...
103
click to vote
JGAA
2008
15 years 1 months ago
2008
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...
111
click to vote
GD
2003
Springer
15 years 7 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
105
Voted
JGAA
2007
15 years 1 months ago
2007
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...
97
Voted
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...