Genetic algorithms for drawing bipartite graphs (1994)
by
Erkki Mäkinen
,
Mika Sieranta
| Venue: | INTERN. J. COMPUTER MATH |
| Citations: | 12 - 3 self |
BibTeX
@ARTICLE{Mäkinen94geneticalgorithms,
author = {Erkki Mäkinen and Mika Sieranta},
title = {Genetic algorithms for drawing bipartite graphs},
journal = {INTERN. J. COMPUTER MATH},
year = {1994},
volume = {53},
pages = {157--166}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper introduces genetic algorithms for the level permutation problem (LPP). The problem is to minimize the number of edge crossings in a bipartite graph when the order of vertices in one of the two vertex subsets is fixed. We show that genetic algorithms outperform the previously known heuristics especially when applied to low density graphs. Values for various parameters of genetic LPP algorithms are tested.
