A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 396-408
- https://doi.org/10.1007/bfb0021823
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An algorithm for drawing general undirected graphsPublished by Elsevier ,2003
- Molecular graph eigenvectors for molecular coordinatesPublished by Springer Nature ,1995
- Three-dimensional graph drawingPublished by Springer Nature ,1995
- Algorithms for drawing graphs: an annotated bibliographyComputational Geometry, 1994
- Automating the layout of network diagrams with specified visual organizationIEEE Transactions on Systems, Man, and Cybernetics, 1994
- Problem Independent Distributed Simulated Annealing and its ApplicationsPublished by Springer Nature ,1993
- Graph drawing by force‐directed placementSoftware: Practice and Experience, 1991
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- The Annealing AlgorithmPublished by Springer Nature ,1989