PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

DRAWING GRAPHS USING SIMULATED ANNEALING AND GRADIENT DESCENT
Janez Brank
In: SIKDD 2004 at multiconference IS 2004, 12-15 Oct 2004, Ljubljana, Slovenia.

Abstract

This paper presents graph drawing as an optimization problem. Each vertex of the graph is to be represented by a point in the plane, and each edge by a straight line between two points. To evaluate a drawing, an energy function is defined that depends on the coordinates of all the vertices. To find a good drawing, various optimization techniques, such as simulated annealing, can be used. We show a wellknown example of an energy function and describe how it can be modified to become differentiable and thus suitable for minimization using gradient descent. We compare the results of this approach with the results of simulated annealing on several graphs.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:744
Deposited By:Blaz Fortuna
Deposited On:30 December 2004