Orthogonal drawings of graphs with vertex and edge labels

Computational Geometry: Theory and Applications

Volumn 32, Issue 2, 2005, Pages 71-114

  Binucci, Carla ^a   Didimo, Walter ^a   Liotta, Giuseppe ^a   Nonato, Maddalena ^b  

^a UNIVERSITY OF PERUGIA   (Italy)

^b UNIVERSITY OF FERRARA   (Italy)

Author keywords

Compaction algorithms; Experimental analysis; Graph drawing; Labeling; Orthogonal representations

Indexed keywords

EID: 24344493850     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2005.02.001     Document Type: Article

References (30)

1. E. Aarts, and J.K. Lenstra Local Search in Combinatorial Optimization 1977 Wiley Chichester
2. C. Batini, E. Nardelli, and R. Tamassia A layout algorithm for data flow diagrams IEEE Trans. Software Engrg. SE-12 4 1986 538 546 (Pubitemid 16595969)
3. S. Bridgeman, G. Di Battista, W. Didimo, G. Liotta, R. Tamassia, and L. Vismara Turn-regularity and optimal area drawings of orthogonal representations Computational Geometry 16 2000 53 93
4. G. Di Battista, W. Didimo, M. Patrignani, and M. Pizzonia Orthogonal and quasi-upward drawings with vertices of arbitrary sizes Symposium on Graph Drawing (GD'99) Lecture Notes in Comput. Sci. vol. 1731 2000 297 310
5. G. Di Battista, W. Didimo, M. Patrignani, and M. Pizzonia Drawing database schemas Software Practice and Experience 32 2002 1065 1098 (Pubitemid 35023072)
6. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis Graph Drawing 1999 Prentice-Hall Upper Saddle River, NJ
7. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu An experimental comparison of four graph drawing algorithms Computational Geometry 7 1997 303 326
8. R. Fletcher, and S. Leyffer Numerical experience with lower bounds for MIQP branch-and-bound SIAM J. Optim. 8 1998 604 616
9. U. Fößmeier, and M. Kaufmann Drawing high degree graphs with low bend numbers Symposium on Graph Drawing (GD'95) Lecture Notes in Comput. Sci. vol. 1027 1996 254 266
10. R. Fourer, D.M. Gay, and B.W. Kernighan AMPL: A Modeling Language For Mathematical Programming 1993 Duxbury Press/Brooks/Cole Publishing Company
11. M. Garey, and D. Johnson Crossing number is NP-complete SIAM J. Algebraic Discrete Methods 4 3 1983 312 316
12. F. Harary Graph Theory 1972 Addison-Wesley Reading, MA
13. ILOG CPLEX http://www.ilog.com/products/cplex
14. E. Imhof Positioning names on maps American Cartographer 2 2 1975 128 144
15. K.G. Kakoulis, and I.G. Tollis On the complexity of the edge label placement problem Computational Geometry 18 2001 1 17 (Pubitemid 33675322)
16. K.G. Kakoulis, and I.G. Tollis A unified approach to automatic label placement Internat. J. Comput. Geom. Appl. 13 1 2003 23 59 (Pubitemid 36344986)
17. T. Kato, and H. Imai The NP-completeness of the character placement problem of 2 or 3 degrees of freedom Record of Joint Conference of Electrical and Electronic Engineers in Kyushu 1988 11 18
18. M. Kaufmann, and D. Wagner Drawing Graphs 2001 Springer-Verlag Berlin
19. G. Klau, K. Klein, and P. Mutzel An experimental comparison of orthogonal compaction algorithms Symposium on Graph Drawing (GD'00) Lecture Notes in Comput. Sci. vol. 1984 2001 37 51 (Pubitemid 33243317)
20. G. Klau, and P. Mutzel Combining graph labeling and compaction Symposium on Graph Drawing (GD'99) Lecture Notes in Comput. Sci. 1999 27 37
21. G. Klau, and P. Mutzel Optimal compaction of orthogonal grid drawings Integer Programming and Combinatorial Optimization (IPCO'99) Lecture Notes in Comput. Sci. vol. 1610 1999 304 319
22. R. Lazimy Improved algorithm for mixed-integer quadratic programs and a computational study Math. Programming 32 1985 100 113 (Pubitemid 15511517)
23. J. Marks, S. Shieber, The computational complexity of cartographic label placement, Technical Report 05-91, Harvard University, 1995
24. G.L. Nemhauser, and L.A. Wolsey Integer and Combinatorial Optimization 1999 Wiley Interscience New York
25. C.H. Papadimitriou, and K. Steiglitz Combinatorial Optimization: Algorithms and Complexity 1982 Prentice-Hall Englewood Cliffs, NJ
26. M. Patrignani On the complexity of orthogonal compaction Computational Geometry 19 2001 47 67 (Pubitemid 33674548)
27. R. Tamassia On embedding a graph in the grid with the minimum number of bends SIAM J. Comput. 16 3 1987 421 444 (Pubitemid 17583644)
28. A. Wolff The map labeling bibliography http://i11www.ira.uka.de/~awolff/ map-labeling/bibliography/
29. A. Wolff, A simple proof for the NP-hardness of edge labeling, Technical Report 11/2000, Institut für Mathematik und Informatik, Universitaät Greifswald, September, 2000
30. P. Yoeli The logic of automated map lettering Cartographic J. 9 2 1972 99 108