An alternative method to crossing minimization on hierarchical graphs

SIAM Journal on Optimization

Volumn 11, Issue 4, 2001, Pages 1065-1080

  Mutzel, Petra ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

2 level graphs; 2 level planarization; Branch and cut; Graph drawing; Integer linear programming; Polyhedral combinatorics

Indexed keywords

EID: 0035618985     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623498334013     Document Type: Article

References (38)

1. M. J. CARPANO, Automatic display of hierarchized graphs for computer aided decision analysis, IEEE Trans. Syst. Man and Cybern., SMC-10 (1980), pp. 705-715.
2. G. DI BATTISTA AND E. NARDELLI, Hierarchies and planarity theory, IEEE Trans. Syst. Man and Cybern., 18 (1988), pp. 1035-1046.
3. S. DRESBACH, A new heuristic layout algorithm for DAGs, in Operations Research Proceedings 1994, U. Derigs, A. Bachem, and A. Drexl, eds., Springer-Verlag, Berlin, 1994, pp. 121-126.
4. P. EADES AND D. KELLY, Heuristics for drawing 2-layered networks, Ars Combin., 21-A (1986), pp. 89-98.
5. P. EADES, B. D. MCKAY, AND N. C. WORMALD, On an edge crossing problem, in Proceedings of the 9th Austral. Comp. Sci. Conference, Australian National University, Canberra, Australia, 1986, pp. 327-334.
6. P. EADES AND S. WHITESIDES, Drawing graphs in two layers, Theoret. Comput. Sci., 131 (1994), pp. 361-374.
7. P. EADES AND N. C. WORMALD, Edge crossings in drawings of bipartite graphs, Algorithmica, 10 (1994), pp. 379-403.
8. J. EDMONDS, Submodular functions, matroids and certain polyhedra, in Combinatorial Structures and Their Applications, Gordon and Breach, London, 1970, pp. 69-87.
9. A. FUKUDA, Face lattices, personal communication, 1996.
10. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, 1 (1981), pp. 169-197.
11. M. GRÖTSCHEL AND M. W. PADBERG, Polyhedral theory, in The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E. L. Lawler et al., eds., Wiley-Interscience, New York, 1985, pp. 1-10.
12. F. HARARY AND A. SCHWENK, A new crossing number for bipartite graphs, Util. Math., 1 (1972), pp. 203-209.
13. P. HEALY AND A. KUUSIK, The vertex-exchange graph: A new concept for multi-level crossing minimization, in Proceedings of Graph Drawing '99, Lecture Notes in Comput. Sci. 1731, J. Kratochvíl, ed., Springer-Verlag, Berlin, New York, 1999, pp. 205-216.
14. L. S. HEATH AND S. V. PEMMARAJU, Recognizing leveled-planar dags in linear time, in Proceedings of Graph Drawing '95, Lecture Notes in Comput. Sci. 1027, F. Brandenburg, ed., Springer-Verlag, Berlin, New York, 1996, pp. 300-311.
15. M. JÜNGER, E. LEE, P. MUTZEL, AND T. ODENTHAL, A polyhedral approach to the multilayer crossing number problem, in Proceedings of Graph Drawing '97, Lecture Notes in Comput. Sci. 1353, G. Di Battista, ed., Springer-Verlag, Berlin, New York, 1997, pp. 13-24.
16. M. JÜNGER, S. LEIPERT, AND P. MUTZEL, Pitfalls of using PQ-trees in automatic graph drawing, in Proceedings of Graph Drawing '97, Lecture Notes in Comput. Sci. 1353, G. Di Battista, ed., Springer-Verlag, Berlin, New York, 1997, pp. 193-204.
17. M. JÜNGER, S. LEIPERT, AND P. MUTZEL, Level planarity testing in linear time, in Proceedings of Graph Drawing '98, Lecture Notes in Comput. Sci. 1547, S. Whitesides, ed., Springer-Verlag, Berlin, New York, 1998, pp. 224-237.
18. M. JÜNGER AND P. MUTZEL, Solving the maximum planar subgraph problem by branch and cut, in Proceedings of the 3rd IPCO Conference, L. A. Wolsey and G. Rinaldi, eds., Erice, CIACO, Louvain-La-Neuve, 1993, pp. 479-492.
19. M. JÜNGER AND P. MUTZEL, Maximum planar subgraphs and nice embeddings: Practical layout tools, Algorithmica, 16 (1996), pp. 33-59.
20. M. JÜNGER AND P. MUTZEL, Exact and heuristic algorithms for 2-layer straightline crossing minimization, in Proceedings of Graph Drawing '95, Lecture Notes in Comput. Sci. 1027, F. Brandenburg, ed., Springer-Verlag, Berlin, New York, 1996, pp. 337-348.
21. M. JÜNGER AND P. MUTZEL, 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms, J. Graph Algorithms Appl., 1 (1996), pp. 1-25. Available online at http://www.cs.brown.edu/publications/jgaa/.
22. M. JÜNGER AND S. THIENEL, The ABACUS-system for branch and cut and price algorithms in integer programming and combinatorial optimization, Softw. Pract. Exper., 30 (2000), pp. 1325-1352.
23. R. M. KARP AND C. H. PAPADIMITRIOU, On linear characterizations of combinatorial optimization problems, in Proceedings of the 21st Annual Symposium on the Foundations of Computer Science, IEEE, Piscataway, NJ, 1980, pp. 1-9.
24. D. E. KNUTH, The Stanford GraphBase: a Platform for Combinatorial Computing, Addison-Wesley, New York, 1993.
25. T. LENGAUER, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley & Sons, Chichester, UK, 1990.
26. E. MÄKINEN, Experiments on drawing 2-level hierarchical graphs, Int. J. Comput. Math., 37 (1990), pp. 129-135.
27. P. MUTZEL, The Maximum Planar Subgraph Problem, Dissertation, Universität zu Köln, Germany, 1994.
28. M. W. PADBERG AND M. R. RAO, The Russian Method for Linear Inequalities III: Bounded Integer Programming, GBA Working Paper, New York University, New York, 1981.
29. M. W. PADBERG AND L. A. WOLSEY, Trees and cuts, Ann. Discrete Math., 17 (1983), pp. 511-517.
30. W. R. PULLEYBLANK, Polyhedral combinatorics, in Optimization, Handbooks Oper. Res. Management Sci. 1, G.L. Nemhauser, A. H. G. Rinnoy Kan, and M. J. Todd, eds., North-Holland, Amsterdam, 1989, pp. 371-446.
31. F. SHAHROKHI, O. SÝKORA, L. A. SZÉKELY, AND I. VRŤO, On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem, in Proceedings of the Workshop on Algorithms and Data Structures (WADS '97), Lecture Notes in Comput. Sci. 1272, F. Dehne et al., eds., Springer-Verlag, Berlin, New York, 1997, pp. 55-68.
32. K. SUGIYAMA, S. TAGAWA, AND M. TODA, Methods for visual understanding of hierarchical system structures, IEEE Trans. Syst. Man Cybern., SMC-11 (1981), pp. 109-125.
33. N. TOMII, Y. KAMBAYASHI, AND Y. SHUZO, On Planarization Algorithms of 2-Level Graphs, Technical report EC77-38, Institute of Electronic and Communication Engineers of Japan (IECEJ), Tokyo, Japan, 1977.
34. J. D. ULLMAN, Computational Aspects of VLSI, Computer Science Press, Rockville, MD, 1984.
35. V. VALLS, R. MARTI, AND P. LINO, A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs, J. Oper. Res., 90 (1996), pp. 303-319.
36. M. VINGRON, H.-P. LENHOF, AND P. MUTZEL, Computational molecular biology, in Annotated Bibliographies in Combinatorial Optimization, M. Dell'Amico, F. Maffioli, and S. Martello, eds., John Wiley & Sons, New York, 1997, pp. 445-471.
37. J. N. WARFIELD, Crossing theory and hierarchy mapping, IEEE Trans. Syst. Man Cybern., SMC-7 (1977), pp. 505-523.
38. M. S. WATERMAN AND J. R. GRIGGS, Interval graphs and maps of DNA, Bull. Math. Biology, 48 (1986), pp. 189-195.