The constrained crossing minimization problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1731, Issue , 1999, Pages 175-185

  Mutzel, Petra ^a   Ziegler, Thomas ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); GRAPH THEORY; INDUCTIVE LOGIC PROGRAMMING (ILP);

BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL EXPERIMENT; CROSSING MINIMIZATION; EDGE CROSSING; GRAPH DRAWING METHODS; INTEGER LINEAR PROGRAMMING FORMULATION; PLANARIZATION; VALID INEQUALITY;

INTEGER PROGRAMMING;

EID: 84958969731     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46648-7_18     Document Type: Conference Paper

References (7)

1. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl., 7:303-326, 1997.
2. M.R. Garey and D.S. Johnson. Crossing Number is NP-Complete. SIAM J. Alg. Disc. Meth., Vol.4, No.3: 312-316, 1983.
3. S. Masuda, K. Nakajima, T. Kashiwabara, and T. Fujisawa. Crossing Minimization in Linear Embeddings of Graphs. In: IEEE Transactions on Computers, Vol.39, No.1: 124-127, 1990.
4. P. Mutzel and T. Ziegler. The Constrained Crossing Minimization Problem - A First Approach. In: P.Kall, H.-J. Lüthi (Eds.): Operations Research Proceedings 1998, Springer-Verlag, pp. 125-134, 1999.
5. P. Mutzel and T. Ziegler. The Constrained Crossing Minimization Problem. Forthcoming Technical Report, MPI Informatik, Saarbrücken, Germany, 1999.
6. K. Mehlhorn and S. Näher. LEDA: A platform for combinatorial and geometric computing. Comm. Assoc. Comput. Mach., 38:96-102, 1995.
7. M. Jünger and S. Thienel. Introduction to ABACUS-A Branch-And-CUt System. Technical Report No. 97.263, Institut für Informatik, Universität zu Köln, 1997, to appear in Operations Research Letters, 1999.