Sciweavers

23 search results - page 1 / 5
» Drawing Undirected Graphs with Genetic Algorithms
Sort
View
ICNC
2005
Springer
13 years 9 months ago
Drawing Undirected Graphs with Genetic Algorithms
This paper proposes an improved genetic algorithm for producing aesthetically pleasing drawings of general undirected graphs. Previous undirected graph drawing algorithms draw larg...
Qing-Guo Zhang, Huayong Liu, Wei Zhang, Ya-Jun Guo
GD
2005
Springer
13 years 9 months ago
Applications of Parameterized st-Orientations in Graph Drawing Algorithms
Abstract. Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a d...
Charalampos Papamanthou, Ioannis G. Tollis
GD
2000
Springer
13 years 7 months ago
A Fast Multi-scale Method for Drawing Large Graphs
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graph...
David Harel, Yehuda Koren
WADS
2001
Springer
143views Algorithms» more  WADS 2001»
13 years 8 months ago
An Approach for Mixed Upward Planarization
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
Markus Eiglsperger, Michael Kaufmann
DSD
2003
IEEE
100views Hardware» more  DSD 2003»
13 years 9 months ago
Fast Heuristics for the Edge Coloring of Large Graphs
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
Mario Hilgemeier, Nicole Drechsler, Rolf Drechsler