Author:
Quigley Aaron,Eades Peter
Publisher
Springer Berlin Heidelberg
Reference39 articles.
1. Richard J. Anderson, Tree data structures and n-body simulation, SIAM J. Comput. 28 (1999), no. 6, 1923–1940.
2. J. Barnes and P. Hut, A hierarchical o(n log n) force-calculation algorithm, Nature 324 (1986), no. 4, 446–449.
3. Francois Bertault, A force-directed algorithm that preserves edge crossing properties, Seventh International Symposium on Graph Drawing (Prague, Chezh Republic) (Jan Kratochvíl, ed.), Springer, September 1999, pp. 351–358.
4. G. Blellcoh and G. Narlikar, A practical comparison of n-body algorithms, Technical report, Wright Laboratory, 1991.
5. Peter Eades, A heuristic for graph drawing, Congresses Numerantium 42 (1984), 149–160.
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献