Author:
Baur Michael,Brandes Ulrik
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Baur, M., Brandes, U.: Crossing reduction in circular layouts. Technical Report 2004-14, Universität Karlsruhe (TH), Fakultät für Informatik (August 2004)
2. Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Computational Geometry: Theory and Applications 7, 303–326 (1997)
3. Lecture Notes in Computer Science;U. Do˘grusöz,1997
4. Eades, P., Kelly, D.: Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria 21(A), 89–98 (1986)
5. Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11, 379–403 (1994)
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献