Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop
Show entries of:
this year
(2019) |
last year
(2018) |
two years ago
(2017) |
Notes URL
Action:
login to update
Options:
Goto entry point
Author, Editor
Author(s):
Klau, Gunnar W.
Mutzel, Petra
dblp
dblp
Editor(s):
Kratochvíl, Jan
dblp
BibTeX cite key*:
KlauMutzel1999
Title, Booktitle
Title*:
Combining Graph Labeling and Compaction
Booktitle*:
Proceedings of the 7th International Symposium on Graph Drawing (GD-99)
Event, URLs
URL of the conference:
URL for downloading the paper:
Event Address*:
Stirin Castle, Czech Republic
Language:
English
Event Date*
(no longer used):
September 15 - 18
Organization:
Event Start Date:
7 December 2019
Event End Date:
7 December 2019
Publisher
Name*:
Springer
URL:
Address*:
Berlin
Type:
Vol, No, Year, pp.
Series:
Lecture Notes in Computer Science
Volume:
1731
Number:
Month:
September
Pages:
27-37
Year*:
1999
VG Wort Pages:
ISBN/ISSN:
0302-9743
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
Combinations of graph drawing and map labeling problems yield
challenging mathematical problems and have direct applications,
\emph{e.g.}, in automation engineering. We call graph drawing problems
in which subsets of vertices and edges need to be labeled \emph{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 drawing problem instance are yet to be determined and
thus create additional degrees of freedom. We concentrate on the
\emph{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
weighted sum of edge length and perimeter. We characterize feasible
solutions of the \emph{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 \emph{COLA} problem. 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.
Keywords:
Graph Labeling, Graph Drawing, Map Labeling, Compaction, Branch and Cut, Integer Programming
Download
Access Level:
Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Algorithms and Complexity Group
Audience:
experts only
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography
BibTeX Entry:
@INPROCEEDINGS
{
KlauMutzel1999
,
AUTHOR = {Klau, Gunnar W. and Mutzel, Petra},
EDITOR = {Kratochv{\'i}l, Jan},
TITLE = {Combining Graph Labeling and Compaction},
BOOKTITLE = {Proceedings of the 7th International Symposium on Graph Drawing (GD-99)},
PUBLISHER = {Springer},
YEAR = {1999},
VOLUME = {1731},
PAGES = {27--37},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Stirin Castle, Czech Republic},
MONTH = {September},
ISBN = {0302-9743},
}
Entry last modified by Anja Becker, 03/02/2010
Edit History (please click the blue arrow to see the details)
Edit History (please click the blue arrow to see the details)
Editor(s)
Gunnar Klau
Created
03/21/2000 10:51:51 AM
Revisions
2.
1.
0.
Editor(s)
Anja Becker
Gunnar Klau
Gunnar Klau
Edit Dates
30.03.2000 12:26:22
23/03/2000 09:33:39
21/03/2000 10:51:52