Evolutionary graph drawing algorithms
β Scribed by Huang Jing-wei; Wei Wen-fang
- Publisher
- Wuhan University
- Year
- 2003
- Tongue
- English
- Weight
- 389 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1007-1202
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Graph drawing plays an important role in the solution of many information visualization problems. Most of the graph drawing algorithms are accompanied by a theoretical analysis of their characteristics, but only extensive experimentations can assess the practical performance of graph drawing algorit
A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical s
The algorithms of Kamada-Kawai (KK) and Fruchterman-Reingold (FR) have been recently generalized (Pisanski et al., Croat. Chem. Acta 68 (1995) 283) in order to draw molecular graphs in three-dimensional space. The quality of KK and FR geometries is studied here by comparing them with the molecular m
This paper examines the use of graph based evolutionary algorithms (GBEAs) for optimization of heat transfer in a complex system. The specific case examined in this paper is the optimization of heat transfer in a biomass cookstove utilizing threedimensional computational fluid dynamics to generate t