A GA-inspired approach to the reduction of edge crossings in force-directed layouts

Farshad Ghassemi Toosi, Nikola S. Nikolov, Malachy Eaton

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We report on our findings using a genetic algorithm (GA) as a preprocessing step for force-directed graph drawings to find a smart initial vertex layout (instead of a random initial layout) to decrease the number of edge crossings in the graph. We demonstrate that the initial layouts found by our GA improve the chances of finding better results in terms of the number of edge crossings, especially for sparse graphs and star-shaped graphs. In particular we demonstrate a reduction in edge-crossings for the class of star-shaped graphs by using our GA over random vertex placement in the order of 3:1.

Original languageEnglish
Title of host publicationGECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference
EditorsTobias Friedrich
PublisherAssociation for Computing Machinery, Inc
Pages89-90
Number of pages2
ISBN (Electronic)9781450343237
DOIs
Publication statusPublished - 20 Jul 2016
Event2016 Genetic and Evolutionary Computation Conference, GECCO 2016 Companion - Denver, United States
Duration: 20 Jul 201624 Jul 2016

Publication series

NameGECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference

Conference

Conference2016 Genetic and Evolutionary Computation Conference, GECCO 2016 Companion
Country/TerritoryUnited States
CityDenver
Period20/07/1624/07/16

Keywords

  • Combinatorial optimization
  • Fitness evaluation
  • Genetic algorithms
  • Routing and layout
  • Running time analysis

Fingerprint

Dive into the research topics of 'A GA-inspired approach to the reduction of edge crossings in force-directed layouts'. Together they form a unique fingerprint.

Cite this