431 search results - page 25 / 87 » Bold Graph Drawings |
IPL
2002
13 years 7 months ago
2002
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
GD
2004
Springer
14 years 24 days ago
2004
Springer
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
GD
2007
Springer
14 years 1 months ago
2007
Springer
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
17
Voted
IV
2006
IEEE
14 years 1 months ago
2006
IEEE