942 search results - page 10 / 189 » Constraints in Graph Drawing Algorithms |
GD
1998
Springer
13 years 11 months ago
1998
Springer
GD
2000
Springer
13 years 11 months ago
2000
Springer
JGAA
1998
13 years 7 months ago
1998
GD
2005
Springer
14 years 1 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
JGAA
2000
13 years 7 months ago
2000
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...