Skip to main content

A Tabu Search Based Approach for Graph Layout

Dib, Fadi, Rodgers, Peter (2014) A Tabu Search Based Approach for Graph Layout. Journal of Visual Languages and Computing, 25 (6). pp. 912-923. ISSN 1045-926X. (doi:10.1016/j.jvlc.2014.10.019)

PDF (Extended version for JVLC Journal) - Author's Accepted Manuscript
Download (860kB) Preview
[img]
Preview
PDF (DMS 2014 conference Version) - Author's Accepted Manuscript
Download (856kB) Preview
[img]
Preview
Official URL
http://dx.doi.org/10.1016/j.jvlc.2014.10.019

Abstract

This paper describes an automated tabu search based method for drawing general graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing. We formulated the task as a multi-criteria optimization problem with a number of

quality of the graph layout. The main goal of this work is to speed up the graph

search based method that goes through a predefined number of iterations to minimize

the neighbourhood. This may lead to cycling, so a tabu list is used to store moves

solutions for a set period of time. We evaluate the method according to the time

results applied on random graphs and we provide statistical evidence that our

time while it produces comparably good graph layouts.We also demonstrate the method

real world setting.

Item Type: Article
DOI/Identification number: 10.1016/j.jvlc.2014.10.019
Additional information: Work first published at DMS2014. Extended for JVLC Journal
Uncontrolled keywords: Graph Drawing, Tabu Search
Subjects: Q Science > QA Mathematics (inc Computing science)
Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Computational Intelligence Group
Depositing User: Peter Rodgers
Date Deposited: 20 Oct 2014 09:39 UTC
Last Modified: 23 Jan 2020 04:08 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/43502 (The current URI for this page, for reference purposes)
Rodgers, Peter: https://orcid.org/0000-0002-4100-3596
  • Depositors only (login required):

Downloads

Downloads per month over past year