Author:
Di Giacomo Emilio,Didimo Walter,Liotta Giuseppe,Meijer Henk
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Lecture Notes in Computer Science;P. Bose,1995
2. Chan, T.M.: A near-linear area bound for drawing binary trees. Algorithmica 34(1), 1–13 (2002)
3. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)
4. Eades, P., Whitesides, S.: The realization problem for euclidean minimum spanning trees in NP-hard. Algorithmica 16(1), 60–82 (1996)
5. Eades, P., Whitesides, S.: The realization problem for Euclidean minimum spanning trees is NP-hard. Algorithmica 16, 60–82 (1996)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献