Author:
Brandes Ulrik,Schulz Frank,Wagner Dorothea,Willhalm Thomas
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows. Prentice-Hall, 1993.
2. J. Branke, F. Bucher, and H. Schmeck. A genetic algorithm for drawing undirected graphs. Proc. 3rd Nordic Workshop on Genetic Algorithms and their Applications, pp. 193–206, 1997.
3. R. L. Brooks, C. A. B. Smith, A. H. Stone, and W. T. Tutte. The dissection of rectangles into squares. Duke Mathematical Journal, 7:312–340, 1940.
4. Lect Notes Comput Sci;I. F. Cruz,1996
5. R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15(4):301–331, 1996.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献