@inproceedings{7d2ce7f9262446c790d6b26a937b64f7,
title = "Simulated annealing as a pre-processing step for force-directed graph drawing",
abstract = "We report on our findings using Simulated Annealing (SA) as a preprocessing step for force-directed graph drawing. Our proposed SA algorithm finds a smart initial vertex placement (instead of a random initial vertex placement) in order to decrease the chance of having edge crossings (local minima) and also to decrease the number of required iterations from start placement to the final placement.",
keywords = "Combinatorial optimization, Fitness evaluation, Routing and layout, Running time analysis, Simulated annealing",
author = "{Ghassemi Toosi}, Farshad and Nikolov, {Nikola S.} and Malachy Eaton",
note = "Publisher Copyright: {\textcopyright} 2016 ACM.; 2016 Genetic and Evolutionary Computation Conference, GECCO 2016 Companion ; Conference date: 20-07-2016 Through 24-07-2016",
year = "2016",
month = jul,
day = "20",
doi = "10.1145/2908961.2931660",
language = "English",
series = "GECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference",
publisher = "Association for Computing Machinery, Inc",
pages = "997--1000",
editor = "Tobias Friedrich",
booktitle = "GECCO 2016 Companion - Proceedings of the 2016 Genetic and Evolutionary Computation Conference",
}