Combining Graph Labeling and Compaction

Extended Abstract
  • Gunnar W. Klau
  • Petra Mutzel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1731)


Combinations of graph drawing and map labeling problems yield challenging mathematical problems and have direct applications, e.g., in automation engineering.We call graph drawing problems in which subsets of vertices and edges need to be labeled graph labeling problems. Unlike in map labeling where the position of the objects is specified in the input, the coordinates of vertices and edges in a graph labeling problem instance have yet to be determined and thus create additional degrees of freedom. We concentrate on the Compaction and Labeling (COLA) Problem: Given an orthogonal representation—as produced by algorithms within the topology-shape-metrics paradigm—and some label information, the task is to generate a labeled orthogonal embedding with minimum total edge length. We characterize feasible solutions of the COLA problem extending an existing framework for solving pure compaction problems. Based on the graph-theoretical characterization, we present a branch-and-cut algorithm which computes optimally labeled orthogonal drawings for given instances of the COLA problem. First computational experiments on a benchmark set of practical instances show that our method is superior to the traditional approach of applying map labeling algorithms to graph drawings. To our knowledge, this is the first algorithm especially designed to solve graph labeling problems.


Shape Description Cola Problem Constraint Graph Graph Drawing Negative Cycle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. AGD99.
    AGD. AGD User Manual. Max-Planck-Institut Saarbrücken, Universität Halle, Universität Köln, 1999.
  2. BMT97.
    T. Biedl, B. Madden, and I. Tollis. The three-phase method: A unified approach to orthogonal graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD’ 97), volume 1353 of Lecture Notes in Computer Science, pages 391–402. Springer-Verlag, 1997.CrossRefGoogle Scholar
  3. DETT99.
    G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, 1999.Google Scholar
  4. FK96.
    U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD’ 95), volume 1027 of Lecture Notes in Computer Science, pages 254–266. Springer-Verlag, 1996.CrossRefGoogle Scholar
  5. FK97.
    U. Fößmeier and M. Kaufmann. Algorithms and area bounds for nonplanar orthogonal drawings. In G. Di Battista, editor, Graph Drawing (Proc. GD’ 97), volume 1353 of Lecture Notes in Computer Science, pages 134–145. Springer-Verlag, 1997.CrossRefGoogle Scholar
  6. IL97.
    C. Iturriaga and A. Lubiw. Elastic labels: The two-axis case. In G. Di Battista, editor, Graph Drawing (Proc. GD’ 97), volume 1353 of Lecture Notes in Computer Science, pages 181–192, 1997.CrossRefGoogle Scholar
  7. KM98.
    G. W. Klau and P. Mutzel. Quasi-orthogonal drawing of planar graphs. Technical Report MPI-I-98-1-013, Max-Planck-Institut für Informatik, Saarbrüücken, May 1998.Google Scholar
  8. KM99.
    G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. In G. P. Cornuéjols, editor, Integer Programming and Combinatorial Optimization (IPCO’ 99), number 1610 in Springer Lecture Notes in Computer Science, pages 304–319, 1999.CrossRefGoogle Scholar
  9. KT97.
    K. G. Kakoulis and I. G. Tollis. An algorithm for labeling edges of hierarchical drawings. In G. Di Battista, editor, Graph Drawing (Proc. GD’ 97), volume 1353 of Lecture Notes in Computer Science, pages 169–180, 1997.CrossRefGoogle Scholar
  10. Len90.
    T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, New York, 1990.MATHGoogle Scholar
  11. Pat99.
    M. Patrignani. On the complexity of orthogonal compaction. Technical Report RT-DIA-39-99, Dipartimento di Informatica e Automazione, Università degli Studi di Roma Tre, January 1999.Google Scholar
  12. Tam87.
    R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3): 421–444, 1987. WS. A. Wolff and T. Strijk. The map labeling bibliography. Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Gunnar W. Klau
    • 1
  • Petra Mutzel
    • 1
  1. 1.Max-Planck-Institut für Informatik Im StadtwaldSaarbrückenGermany

Personalised recommendations