A New Approximation Algorithm for Bend Minimization in the Kandinsky Model-Reference-Cited by-同舟云学术

A New Approximation Algorithm for Bend Minimization in the Kandinsky Model

Published: Issue: Volume: Page:343-354
ISSN:
Container-title:Graph Drawing
language:
Short-container-title:

Author:

Barth Wilhelm,Mutzel Petra,Yıldız Canan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70904-6_33.pdf

Reference13 articles.

1. AGD User Manual (1999), http://www.ads.tuwien.ac.at/AGD/

2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)

3. Batini, C., Nardelli, E., Tamassia, R.: A Layout Algorithm for Data Flow Diagrams. IEEE Trans. Softw. Eng (SE) 12(4), 538–546 (1986)

4. Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An Experimental Comparison of Three Graph Drawing Algorithms. In: Proc. 11th Ann. ACM Symp. Comput. Geom., pp. 306–315. ACM Press, New York (1995)

5. Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. IEEE Trans. Comput. 49(8), 826–840 (2000)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Planar Confluent Orthogonal Drawings of 4-Modal Digraphs;Lecture Notes in Computer Science;2023

2. Planar L-Drawings of Bimodal Graphs;Lecture Notes in Computer Science;2020

3. Planar L-Drawings of Directed Graphs;Lecture Notes in Computer Science;2018

4. The Effect of Almost-Empty Faces on Planar Kandinsky Drawings;Experimental Algorithms;2015

5. Visualization of Large Networks;Encyclopedia of Social Network Analysis and Mining;2014