On circular layoutsFootnote^∗

^∗This work was supported by the Academy of Finland

References

• Batini , C. , Nardelli , E. and Tamassia , R. 1986 . A layout algorithm for data flow diagrams . IEEE Trans. Sofiw. Eng , SE-12 : 538 – 546 .
   Web of Science ®Google Scholar
• Batini , C. , Talamo , M. and Tamassia , R. 1984 . Computer aided layout of entity relationship diagrams . J. Syst. Sofiw , 4 : 163 – 173 .
   Web of Science ®Google Scholar
• Brown , M.H. and Sedgewick , R. 1985 . A system for algorithm animation . IEEE Softw , 2 : 28 – 39 .
   Web of Science ®Google Scholar
• Garey , M.R. and Johnson , D.S. 1979 . Computers and Intractability , San Francisco : W. H. Freeman .
   Google Scholar
• Garey , M.R. , Johnson , D.S. and Stockmeyer , L. 1976 . Some simplified NP-complete graph problems . Theor. Comp. Sci , 1 : 237 – 267 .
   Google Scholar
• Hyrskykari , A. and Räihä , K.J. . Animation of algorithms without programming . Proceedings of 1987 Workshop on Visual Languages . pp. 40 – 54 . Sweden : Linköping .
   Google Scholar
• Leung , J.Y. , Vornberger , O. and Witthoff , J.D. 1984 . On some variants of the bandwidth minimization problem . SIAM J. Comput , 13 : 650 – 667 .
   Google Scholar
• Lipton , R.J. , North , S.C. and Sandberg , J.S. 1985 . A method for drawing graphs . ACM Computational Conference Proceedings . June 1985 . pp. 153 – 160 .
   Google Scholar
• Makedon , F.S. and Sudborough , I.H. 1984 . Graph layout problems, in Surveys in Computer Science , Edited by: Maurer , H.A. 145 – 192 . Mannheim : Bibliographisches Institut . Wien/Zürich
   Google Scholar
• Supowit , K.J. and Reingold , E.M. 1983 . The complexity of drawing trees nicely . Acta Inf , 18 : 377 – 392 .
   Google Scholar