Genetic Algorithms for Drawing Directed Graphs

Cezary Janikow; Lindsay Groves; Paul Elia; Zbigniew Michalewicz

Genetic Algorithms for Drawing Directed Graphs

Cezary Janikow, Lindsay Groves, Paul Elia, Zbigniew Michalewicz

University of Missouri-St. Louis

Research output: Contribution to journal › Article › peer-review

Abstract

Genetic algorithms are adaptive algorithms that find solutions to problems by an evolutionary process based on natural selection. They can be used to find approximate solutions to optimization problems in cases where finding the precise optimum is prohibitively expensive. Drawing a directed graph can be viewed as a problem of optimizing the layout of nodes and arcs on a page according to certain aesthetic criteria characterizing “good” drawings of graphs. This paper discusses the use of genetic algorithms for drawing graphs, describing some experiments with two systems we have developed.

Original language	American English
Journal	Methodologies for Intelligent Systems 5
State	Published - Oct 25 1990

Disciplines

Computer Sciences

Access to Document

text.pdfFinal published version, 1.03 MBLicense: Unspecified

Cite this

@article{0d7b17caf33346dea2eab7dd518aaa3f,

title = "Genetic Algorithms for Drawing Directed Graphs",

abstract = " Genetic algorithms are adaptive algorithms that find solutions to problems by an evolutionary process based on natural selection. They can be used to find approximate solutions to optimization problems in cases where finding the precise optimum is prohibitively expensive. Drawing a directed graph can be viewed as a problem of optimizing the layout of nodes and arcs on a page according to certain aesthetic criteria characterizing “good” drawings of graphs. This paper discusses the use of genetic algorithms for drawing graphs, describing some experiments with two systems we have developed.",

author = "Cezary Janikow and Lindsay Groves and Paul Elia and Zbigniew Michalewicz",

year = "1990",

month = oct,

day = "25",

language = "American English",

journal = "Methodologies for Intelligent Systems 5",

}

TY - JOUR

T1 - Genetic Algorithms for Drawing Directed Graphs

AU - Janikow, Cezary

AU - Groves, Lindsay

AU - Elia, Paul

AU - Michalewicz, Zbigniew

PY - 1990/10/25

Y1 - 1990/10/25

N2 - Genetic algorithms are adaptive algorithms that find solutions to problems by an evolutionary process based on natural selection. They can be used to find approximate solutions to optimization problems in cases where finding the precise optimum is prohibitively expensive. Drawing a directed graph can be viewed as a problem of optimizing the layout of nodes and arcs on a page according to certain aesthetic criteria characterizing “good” drawings of graphs. This paper discusses the use of genetic algorithms for drawing graphs, describing some experiments with two systems we have developed.

AB - Genetic algorithms are adaptive algorithms that find solutions to problems by an evolutionary process based on natural selection. They can be used to find approximate solutions to optimization problems in cases where finding the precise optimum is prohibitively expensive. Drawing a directed graph can be viewed as a problem of optimizing the layout of nodes and arcs on a page according to certain aesthetic criteria characterizing “good” drawings of graphs. This paper discusses the use of genetic algorithms for drawing graphs, describing some experiments with two systems we have developed.

M3 - Article

JO - Methodologies for Intelligent Systems 5

JF - Methodologies for Intelligent Systems 5

ER -