Publisher
Springer International Publishing
Reference15 articles.
1. Buchin, K., Buchin, M., Byrka, J., Nöllenburg, M., Okamoto, Y., Silveira, R., Wolff, A.: Drawing (complete) binary tanglegrams. Algorithmica 62(1–2), 309–332 (2012). https://doi.org/10.1007/s00453-010-9456-3
2. Czabarka, É., Székely, L.A., Wagner, S.G.: A tanglegram Kuratowski theorem. J. Graph Theory 90(2), 111–122 (2019). https://doi.org/10.1002/jgt.22370
3. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)
4. Lecture Notes in Computer Science;M Dumas,2012
5. Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11(4), 379–403 (1994). https://doi.org/10.1007/BF01187020
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献