Spring algorithms and symmetry

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

Volumn 1276, Issue , 1997, Pages 202-211

  Eades, Peter ^a   Lin, Xuemin ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; SPRINGS (COMPONENTS);

AUTOMORPHISM GROUPS; AUTOMORPHISMS; EFFECTIVE TOOL; GRAPH LAYOUT; ITS APPLICATIONS; SPRING ALGORITHMS; SYMMETRIC STRUCTURES; UNDIRECTED GRAPH;

GRAPH ALGORITHMS;

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

References (17)

1. J. A. Bondy and U. S. R. Murty, Graph theory with application, The Macmilan Press LTD, 1977.
2. B. Becker and G. Hotz, On the optimal layout of planar graphs with fixed boundary, SIAM J. COMPT. 16(15), 1987.
3. G. Di Battista, P. Eades and R. Tamassia, Algorithms for drawing graphs: an annotated bibliography, Computational Geometry: Theory and Application, 4, 235-282, 1994.
4. P. Eades, A heuristic for graph drawing, Congressus Numerantium, 42, 149-160, 1984.
5. P. Eades and X. Lin, Spring Algorithms and Symmetry, Technical Report, Department of Computer Science, The University of Newcastle, Australia, 1996.
6. T. Fruchterman and E. Reingold, Graph Drawing by Force-Directed Placement, Software-Practice and Experience, 21, 1129-1164, 1991.
7. T. Kamada and S. Kawai, An Algorithm for Drawing General Undirected Graphs, Information Processing Letters, 31, 7-15, 1989.
8. X. Lin, Analysis of Algorithms for Drawing Graphs, PHD thesis, University of Queensland, 1992.
9. R. Lipton, S. North and J. Sandberg, A Method for Drawing Graphs, Proc. ACM Symp. on Computational Geometry, 153-160, 1985.
10. J. Manning, Geometric Symmetry in Graphs, PHD thesis, Purdue University, 1990.
11. G. E. Martin, Transformation Geometry - An Introduction to Symmetry, Springer Verlag, 1982.
12. F. W. Sears and M. W. Zemansky, University Physics, Addition-Wesley, 1963.
13. A. E. Taylor, Advanced Calculus, Ginn, 1955.
14. K. Sugiyama and K. Misue, Graph drawing by the magnetic spring model, Journal of Visual Languages and Computing 6 (3) (1995), 217-232.
15. D. Tunkelang, A practical approach to drawing undirected graphs, Technical Report, Canegie Mellon University 1994.
16. W. T. Tutte, How to draw a graph, Proc. London Math. Soc. 13(3), 304-320, 1963.
17. H. Wielandt, Finite permutation groups, Academic Press Inc., 1964.