A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1027, Issue , 1996, Pages 396-408

  Monien, Burkhard ^a   Ramme, Friedhelm ^a   Salmen, Helmut ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

3D graph layout; Parallel simulated annealing; Straight line drawing

Indexed keywords

COST FUNCTIONS; DRAWING (GRAPHICS); SIMULATED ANNEALING;

3D GRAPHS; INTERMEDIATE CONFIGURATION; PARALLEL METHOD; PARALLEL SIMULATED ANNEALING; PARALLEL SIMULATED ANNEALING ALGORITHM; STRAIGHT-LINE DRAWINGS; STRUCTURE INFORMATION; UNDIRECTED GRAPH;

GRAPH ALGORITHMS;

EID: 84947939316     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0021823     Document Type: Conference Paper

References (17)

1. G.D. Battista, P. Eades, R. Tamassia, I.G. Tollis: Algorithms for drawing graphs: An annotated bibliography, Report, Brown University, June 1994
2. R.F. Cohen, P. Eades, T. Lin, F. Ruskey: Three-Dimensional Graph Drawing, Proc. of Graph Drawing'94, LNCS Springer, Vol. 894, pp. 1-11
3. R. Davidson, D, Harel: Drawing graphs nicely using simulated annealing, Technical Report CS89-13, Department of Applied Mathematics and Computer Science, Weizmann Institute of Science, Israel 1989, revised July 1993, to appear in Communications of the ACM
4. R. Diekmann, R. Lüling, J. Simon: Problem Independent Distributed Simulated Annealing and its Applications, in: R.V.V. Vidal (ed.): Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems, Springer 1993, No. 396, pp. 17-44
5. P. Eades: A heuristic for graph drawing, Congressus Numerantium, 1984, Vol. 42, pp. 149-160
6. P.W. Fowler, T. Pisanski, J. Shawe-Taylor: Molecular Graph Eigenvectors for Molecular Coordinates, Proc. of Graph Drawing'94, LNCS Springer, Vol. 894, pp. 282-285
7. A. Frick, A. Ludwig, H. Mehldau: A Fast Adaptive Layout Algorithm for Undirected Graphs, Proc. of Graph Drawing'94, LNCS Springer, Vol. 894, pp. 388-403
8. T.M.J. Fruchtermann, E.M. Reingołd: Graph drawing by force-directed placement, Software-Practice and Experience, 1991, Vol. 21, No. 11, pp. 1129-1164
9. D. Harel, M. Sardas: Randomized Graph Drawing with Heavy-Duty Preprocessing, Technical Report CS93-16, Department of Applied Mathematics and Computer Science, Weizmann Institute of Science, Israel Oct. 1993
10. M.D. Huang, F. Romeo, A. Sangiovanni-Vincentelli: An Efficient General Cooling Schedule for Simulated Annealing, IEEE Int. Conf. on Computer Aided Design 1986, pp. 381-384
11. D.S. Johnson, C.R. Aragon, L. A. McGeoch, C. Schevon: Optimization by Simulated Annealing: An Experimental Evaluation, Part I, "Graph Partitioning," Operations Research Vol. 37, No. 6, pp. 865-892, 1989; Optimization by Simulated Annealing: An Experimental Evaluation, Part II, "Graph Coloring and Number Partitioning," Operations Research Vol. 39, No. 3, pp. 378-406, 1991
12. T. Kamada, S. Kawai: An algorithm for drawing general undirected graphs, Information Processing Letters, North-Holland 1989, Vol. 31, pp. 7-15 1.
13. T. Kamada, S. Kawai: An algorithm for drawing general undirected graphs, Information Processing Letters, North-Holland 1989, Vol. 31, pp. 7-15 1. [KMS94]
14. O.E. Otten, L. van Ginneken: The Annealing Algorithm, Kluwer Academic Publishers 1989
15. Parsytec Computer Ltd.: Parix 1.3: Software Documentation, Aachen
16. H. Salmen: Dreidimensionale Auslegung beliebiger Graphen mittels parallelem Simulated Annealing Methoden, Master Thesis, Univ. of Paderborn, 1995
17. D. Tunkelang: A layout algorithm for undirected graphs, In Graph Drawing'93, ALCOM Int. Workshop, Paris 1993