852 search results - page 16 / 171 » Using graph parsing for automatic graph drawing |
GD
2006
Springer
13 years 11 months ago
2006
Springer
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
SEW
2005
IEEE
14 years 28 days ago
2005
IEEE
Compared with texts, graphs are more intuitive to express comparative and structural information. Many graphical approaches, however, lack a formal basis for precise specification...
GD
2008
Springer
13 years 8 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...
GD
2008
Springer
13 years 8 months ago
2008
Springer
We introduce a new force-directed model for computing graph layout. The model bridges the two more popular force directed approaches – the stress and the electrical-spring models...
GD
2003
Springer
14 years 17 days 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...