4 search results - page 1 / 1 » Improved Approximations of Crossings in Graph Drawings and V... |
SIAMCOMP
2002
13 years 4 months ago
2002
ISAAC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
GD
1998
Springer
13 years 9 months ago
1998
Springer
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 ...
JGAA
2000
13 years 4 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 ...