JGAA
2000
13 years 11 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 ...
JGAA
2006
13 years 11 months ago
2006
In this paper we present a new characterization of switch-regular upward embeddings, a concept introduced by Di Battista and Liotta in 1998. This characterization allows us to def...
GD
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...