130
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
115
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer
The crossing number cr(G) of a graph G is the minimum number of crossings over all drawings of G in the plane. In 1993, Richter and Thomassen [RT93] conjectured that there is a co...
129
click to vote
GD
2006
Springer
15 years 7 months ago
2006
Springer
Graph drawing software are now commonly used. However, the choice of a well-adapted program may be hard for an inexperienced user. This poster presents a website (http://www.polyte...
104
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...
80
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer