Filters








1,775 Hits in 4.2 sec

Mental map preserving graph drawing using simulated annealing

Chun-Cheng Lin, Yi-Yi Lee, Hsu-Chun Yen
2011 Information Sciences  
In many applications, graphs are 'dynamic' in the sense that changes are constantly applied to a graph to reflect the evolution of the system behaviour represented by the graph.  ...  Users often have to spend a lot of time relearning the redrawn graphs.  ...  To draw graphs nicely, a simulated annealing method was used in (Davidson and Harel, 1996) with the cost function designed to respect the above requirements.  ... 
doi:10.1016/j.ins.2011.06.005 fatcat:mldcenkzsjdlfhes6oh7v4davq

Graph drawing using tabu search coupled with path relinking

Fadi K. Dib, Peter Rodgers, Francesco Pappalardo
2018 PLoS ONE  
We have evaluated our new method against the commonly used neighbourhood search optimization techniques: hill climbing and simulated annealing.  ...  To our knowledge, before our work, neither of these methods have been previously used in general multi-criteria graph drawing.  ...  Simulated annealing was an early search based method to be applied to the graph layout problem [2] . It was used to draw undirected graphs with straight line edges.  ... 
doi:10.1371/journal.pone.0197103 pmid:29746576 pmcid:PMC5945037 fatcat:hrdobgz7p5cslg2gce5ifijrba

A multi-scale algorithm for drawing graphs nicely

Ronny Hadany, David Harel
2001 Discrete Applied Mathematics  
We describe a multi-scale approach to the problem of drawing undirected graphs "nicely", with the straight-line edge convention.  ...  Our algorithm can deal quite easily with very large graphs; some of our examples contain over 1000 vertices. ? (D. Harel). 0166-218X/01/$ -see front matter ? 2001 Elsevier Science B.V.  ...  In [3] , we used a di erent method, whereby simulated annealing was used to maximize a cost function that re ects the aesthetic quality of the drawing.  ... 
doi:10.1016/s0166-218x(00)00389-9 fatcat:g6lu4mvqhffbdgys3dwt7zbvzq

On fast iterative mapping algorithms for stripe based coarse-grained reconfigurable architectures

Gayatri Mehta, Krunalkumar Patel, Nancy S. Pollard
2014 International journal of electronics (Print)  
This paper addresses this challenge for stripe based coarse-grained reconfigurable architectures (CGRAs) by drawing on insights from graph drawing.  ...  We adapt fast, iterative algorithms from hierarchical graph drawing to the problem of mapping to stripe based architectures.  ...  Specifically, we compare two leading algorithms from the graph drawing community to the performance of simulated annealing.  ... 
doi:10.1080/00207217.2014.938310 fatcat:z2b6iwzenjdozikqn6tamhyjga

Drawing graphs with non-uniform vertices

David Harel, Yehuda Koren
2002 Proceedings of the Working Conference on Advanced Visual Interfaces - AVI '02  
Unfortunately, current force directed methods for laying out graphs are suitable mostly for graphs whose vertices are zero-sized and dimensionless points.  ...  The vertices of most graphs that appear in real applications are nonuniform. They can be circles, ellipses, rectangles, or other geometric elements of varying shapes and sizes.  ...  A candidate method for this can be simulated annealing, which was first used for graph drawing in [1] .  ... 
doi:10.1145/1556262.1556288 dblp:conf/avi/HarelK02 fatcat:cbelhsqvs5gzncran4cd2wt6qy

A new force-directed graph drawing method based on edge–edge repulsion

Chun-Cheng Lin, Hsu-Chun Yen
2012 Journal of Visual Languages and Computing  
In this paper, we propose a new force-directed method based on edge-edge repulsion to draw graphs.  ...  The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion.  ...  Davidson and Harel [3] used the paradigm of simulated annealing, suited for combinatorial optimization problems, to draw graphs.  ... 
doi:10.1016/j.jvlc.2011.12.001 fatcat:uayhpcelz5b4bokmgwnodnbkgi

Page 1902 of Mathematical Reviews Vol. , Issue 97C [page]

1997 Mathematical Reviews  
Twarog, 3D graph draw- ing with simulated annealing (162-165); Luc Devroye and Paul Kruszewski, The botanical beauty of random binary trees (166- 177); Giuseppe Di Battista, Giuseppe Liotta and Sue Whitesides  ...  Lipton, Breaking DES using a molecular computer (37-65); Richard J.  ... 

Fast interactive 3-D graph visualization [chapter]

Ingo Bruß, Arne Frick
1996 Lecture Notes in Computer Science  
We present a 3-D version of GEM [6], a randomized adaptive layout aigofithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4] .  ...  We show that GEM-3D is capable of producing a textbook-like drawing of the PETERSEN graph, a notoriously hard case for automatic drawing tools.  ...  Other strategies of achieving convergence are the use of simple cooling schedules that restrict the allowed moves over time [7] or to apply simulated annealing [3, 13] .  ... 
doi:10.1007/bfb0021794 fatcat:ffhqga4phfamdm3cpxy57v5xpe

Spring Embedders and Force Directed Graph Drawing Algorithms [article]

Stephen G. Kobourov
2012 arXiv   pre-print
Also known as spring embedders, such algorithms calculate the layout of a graph using only information contained within the structure of the graph itself, rather than relying on domain-specific knowledge  ...  Graphs drawn with these algorithms tend to be aesthetically pleasing, exhibit symmetries, and tend to produce crossing-free layouts for planar graphs.  ...  The algorithm uses the simulated annealing technique developed for large combinatorial optimization [43] . Simulated annealing is motivated by the physical process of cooling molten materials.  ... 
arXiv:1201.3011v1 fatcat:ndxz6xgx7fdkthtloaty5en2fq

Graphs, They Are Changing [chapter]

Stephan Diehl, Carsten Görg
2002 Lecture Notes in Computer Science  
It differs from previous work on dynamic graph drawing in that it considers all graphs in the sequence (offline) instead of just the previous ones (online) when computing the layout for each graph of the  ...  In this paper we present a generic algorithm for drawing sequences of graphs. This algorithm works for different layout algorithms and related metrics and adjustment strategies.  ...  Implementation In our first prototype implementation we implemented a spring embedder with polar and parallel magnetic fields, gravity, and simulated annealing similar to the algorithm used in VCG [16  ... 
doi:10.1007/3-540-36151-0_3 fatcat:632djjebard5bph2yzst7v2luq

Graph Compact Orthogonal Layout Algorithm [chapter]

Kārlis Freivalds, Jans Glagoļevs
2014 Lecture Notes in Computer Science  
In this paper we present a grid-based algorithm for drawing orthogonal graphs with nodes of prescribed size.  ...  There exist many orthogonal graph drawing algorithms that minimize edge crossings or edge bends, however they produce unsatisfactory drawings in many practical cases.  ...  The idea of using a grid for node placement(although for straight-line drawings) together with simulated annealing is used in drawing of biochemical networks [12, 13, 15] .  ... 
doi:10.1007/978-3-319-09174-7_22 fatcat:bqv2gw2pgze2nm4cmftcttqzt4

Temporal Treemaps: Static Visualization of Evolving Trees

2018 IEEE Transactions on Visualization and Computer Graphics  
We approach it for the entire time span at once using a combination of a heuristic and simulated annealing.  ...  This is based on two major contributions: First, the layout constitutes a graph drawing problem.  ...  The final drawing stage then uses only the graph layout of = 0 directly.  ... 
doi:10.1109/tvcg.2018.2865265 pmid:30137007 fatcat:w4etu7jxiba3fa7dhbvghnqi3e

Particle Methods as Message Passing

Justin Dauwels, Sascha Korl, Hans-andrea Loeliger
2006 2006 IEEE International Symposium on Information Theory  
annealing.  ...  It is shown how particle methods can be viewed as message passing on factor graphs.  ...  The principle of simulating annealing is generic.  ... 
doi:10.1109/isit.2006.261910 dblp:conf/isit/DauwelsKL06 fatcat:k5m5dajjfrhwhfa3yqf54idcpe

The deep learning and statistical physics applications to the problems of combinatorial optimization [article]

Semyon Sinchenko, Dmitry Bazhanov
2019 arXiv   pre-print
One of them is a classical Maximum Cut (MaxCut) problem, which we ascribe here to the search of the ground state of a quantum many-body system using an artificial neural network and deep learning.  ...  As a proof, we have realized our approach for two random graphs of different size, containing 60 vertices (885 edges) and 100 vertices (2475 edges), and achieved for them the total performances p60 0.99  ...  One of the best algorithm of this class is a well known and named as Simulated Annealing (SA) [9] .  ... 
arXiv:1911.10680v1 fatcat:o4exad344rebld5sb7wxffcpvi

Fast Algorithms for Indices of Nested Split Graphs Approximating Real Complex Networks [article]

Irene Sciriha, Johann A. Briffa, Mark Debono
2018 arXiv   pre-print
We present a method based on simulated annealing to obtain a nested split graph that approximates a real complex graph.  ...  This is used to compute a number of graph indices using very efficient algorithms that we develop, leveraging the geometrical properties of nested split graphs.  ...  Simulated annealing For each of the graphs described in Section 5.1, we use simulated annealing to find a similar nested split graph, by minimising one of the distance functions.  ... 
arXiv:1803.00306v3 fatcat:bktcebr2zfhrdozqn2neob5p3u
« Previous Showing results 1 — 15 out of 1,775 results