Author:
Hachul Stefan,Jünger Michael
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Aluru, S., et al.: Distribution-Independent Hierarchical Algorithms for the N-body Problem. Journal of Supercomputing 12, 303–323 (1998)
2. The AT&T graph collection, www.graphdrawing.org
3. Barnes, J., Hut, P.: A hierarchical $\mathcal{O}$ (N logN) force-calculation algorithm. Nature 324(4), 446–449 (1986)
4. Davidson, R., Harel, D.: Drawing Graphs Nicely Using Simulated Annealing. ACM Transaction on Graphics 15(4), 301–331 (1996)
5. Eades, P.: A heuristic for graph drawing. Congressus Numerantium 42, 149–160 (1984)
Cited by
79 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献