About: Graph drawing using tabu search coupled with path relinking

Not logged in : Login

(Sponging disallowed)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Graph drawing using tabu search coupled with path relinking Goto Sponge NotDistinct Permalink

An Entity of Type : bibo:AcademicArticle, within Data Space : linkeddata.uriburner.com:28898 associated with source document(s)

Attributes	Values
type	http://eprints.org/ontology/ArticleEPrint http://eprints.org/ontology/EPrint Article Academic Article
seeAlso	HTML Summary of #67399 Graph drawing using tabu search coupled with path relinking
sameAs	Graph drawing using tabu search coupled with path relinking
http://eprints.org/ontology/hasDocument	Graph drawing using tabu search coupled with path relinking (PDF) Graph drawing using tabu search coupled with path relinking (Other) Graph drawing using tabu search coupled with path relinking (Other) Graph drawing using tabu search coupled with path relinking (Other) Graph drawing using tabu search coupled with path relinking (Other) Graph drawing using tabu search coupled with path relinking (Other)
http://eprints.org/ontology/hasPublished	Graph drawing using tabu search coupled with path relinking (PDF)
dc:hasVersion	Graph drawing using tabu search coupled with path relinking (PDF)
Title	Graph drawing using tabu search coupled with path relinking
described by	https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3
Date	2018-05-10
Creator	Fadi Dib Peter Rodgers
status	peer reviewed published
Publisher	Public Library of Science
abstract	Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria. In this paper, we propose a new neighbourhood search method which uses a tabu search coupled with path relinking to optimize such objective functions for general graph layouts with undirected straight lines. To our knowledge, before our work, neither of these methods have been previously used in general multi-criteria graph drawing. Tabu search uses a memory list to speed up searching by avoiding previously tested solutions, while the path relinking method generates new solutions by exploring paths that connect high quality solutions. We use path relinking periodically within the tabu search procedure to speed up the identification of good solutions. We have evaluated our new method against the commonly used neighbourhood search optimization techniques: hill climbing and simulated annealing. Our evaluation examines the quality of the graph layout (objective function’s value) and the speed of layout in terms of the number of evaluated solutions required to draw a graph. We also examine the relative scalability of each method. Our experimental results were applied to both random graphs and a real-world dataset. We show that our method outperforms both hill climbing and simulated annealing by producing a better layout in a lower number of evaluated solutions. In addition, we demonstrate that our method has greater scalability as it can layout larger graphs than the state-of-the-art neighbourhood search methods. Finally, we show that similar results can be produced in a real world setting by testing our method against a standard public graph dataset.
Is Part Of	PLOS ONE https://kar.kent.ac.uk/id/repository
Subject	Q Science QA 75 Electronic computers. Computer science
list of authors	https://kar.kent.ac.uk/id/eprint/67399#authors
issue	5
volume	13
is topic of	https://www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3
is primary topic of	HTML Summary of #67399 Graph drawing using tabu search coupled with path relinking

Faceted Search & Find service v1.17_git144 as of Jul 26 2024

Alternative Linked Data Documents: iSPARQL | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3331 as of Aug 25 2024, on Linux (x86_64-ubuntu_noble-linux-glibc2.38-64), Single-Server Edition (378 GB total memory, 15 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software