Combining Graph Labeling and Compaction (Extended Abstract)

Klau, Gunnar W. and Mutzel, Petra (1999) Combining Graph Labeling and Compaction (Extended Abstract). In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 27-37 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_3).

Full text not available from this repository.

Abstract

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.

Item Type:Conference Paper
Additional Information:10.1007/3-540-46648-7_3
Classifications:G Algorithms and Complexity > G.999 Others
G Algorithms and Complexity > G.630 Labeling
ID Code:235

Repository Staff Only: item control page

References

AGD User Manual. Max-Planck-Institut Saarbrücken, Universität Halle, Universität Köln, 1999. http://www.mpi-sb.mpg.de/AGD.

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.

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, 1999.

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.

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.

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.

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.

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.

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.

T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, New York, 1990.

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.

R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421-444, 1987.

A. Wolff and T. Strijk. The map labeling bibliography. http://www.inf.fu-berlin.de/map-labeling/bibliography.