Algorithmen zum automatischen Zeichnen von Graphen
Brandenburg, Franz J. and Jünger, Michael and Mutzel, Petra
(1997)
Algorithmen zum automatischen Zeichnen von Graphen.
Published in:
Informatik-Spektrum Vol. 20 (4).
pp. 199-207.
Abstract
Graph drawing is a new and growing area in Computer Science. It is concerned with the design, analysis, implementation and evaluation of new algorithms for aesthetically nice drawings of graphs. Through the use of some selected examples of applications, typical problems, and solutions, we would like to provide an introduction into this still relatively unknown field. And we survey activities and goals of a working group consisting of members of the universities of Halle, Köln and Passau and the Max-Planck-Institut für Informatik in Saarbrücken, that is funded by the German Science Foundation DFG under the program Èfficient Algorithms for Discrete Problems and their Applications'.
| Download: |
Download (524Kb) | Preview |
|---|---|
| Export as: | |
| Editorial actions: |  View Item (Login required) |
| Item Type: | Article |
|---|---|
| Citations: | 30 (Google Scholar) | |
| Uncontrolled Keywords: | algorithms automatic graph drawing crossing minimization graph editors planarization |
| Subjects: | |
| Divisions: | Institute of Computer Science > Computer Science Department - Prof. Dr. Juenger |
| Related URLs: |
| ZAIK Number: | zpr97-264 |
|---|---|
| Depositing User: | Prof. Dr. Michael Jünger |
| Date Deposited: | 10 Jun 2003 00:00 |
| Last Modified: | 19 Dec 2011 09:45 |
| URI: | http://e-archive.informatik.uni-koeln.de/id/eprint/264 |
