Suche auf der Schloss Dagstuhl Webseite
Sie suchen nach Informationen auf den Webseiten der einzelnen Seminare? - Dann:
Nicht fündig geworden? - Einige unserer Dienste laufen auf separaten Webseiten mit jeweils eigener Suche. Bitte beachten Sie folgende Liste:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Innerhalb dieser Seite:
Externe Seiten:
  • DOOR (zum Registrieren eines Dagstuhl Aufenthaltes)
  • DOSA (zum Beantragen künftiger Dagstuhl Seminare oder Dagstuhl Perspektiven Workshops)
Innerhalb dieser Seite:
Externe Seiten:
Innerhalb dieser Seite:
Externe Seiten:
  • die Informatik-Bibliographiedatenbank dblp

Dagstuhl-Seminar 08191

Graph Drawing with Applications to Bioinformatics and Social Sciences

( 04. May – 09. May, 2008 )

(zum Vergrößern in der Bildmitte klicken)

Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite:



Graph drawing deals with the problem of communicating the structure of relational data through diagrams, or drawings. Graphs with vertices and edges are typically used to model relational data. The vertices represent the objects (or data points) and the edges represent the relationships between the objects. The main problem in relational visualization is to display the data in a meaningful fashion that may heavily depend on the application domain. Some of the application areas where graph drawing tools are needed include computer science (data base design, data mining, software engineering), bioinformatics (metabolic networks, protein-protein interaction), business informatics (business process models), and the social sciences and criminalistics (social networks, phone-call graphs).

The ability to represent relational information in a graphical form is a powerful tool which allows us to perform analysis through visual exploration. With the aid of graph visualization we can find important patterns, trends, and correlations. Real-world applications such as bioinformatics and sociology pose additional challenges, e.g., semantic information carried by the diagram has to be used for obtaining meaningful layouts and application-specific drawing conventions need to be fulfilled. Moreover, the underlying data often stems from huge data bases, but only a small fraction shall be displayed at a time; the user interactively selects the data to be displayed and explores the graph by expanding interesting and collapsing irrelevant parts. This requires powerful graph exploration tools with navigation capabilities that allow dynamic adaption of the graph layout in real time.

Topics of the Seminar

In this seminar we focused on the application of graph drawing in two important application domains: bioinformatics (metabolic pathways, regulatory networks, protein-protein interaction)and social sciences and criminalistics (case information diagrams, phone-call graphs). In both application domains, the underlying information is usually stored in large data bases constituting a huge and complex graph, but only a suitable fraction of this graph is visualized; the selection of that subgraph is guided by the user and even more user interaction occurs in order to further explore the underlying graph. Thus, the user becomes a central actor that triggers dynamic updates of the displayed graph and its layout. The support of application-specific update functionality in conjunction with high quality graph layout is essential for achieving user acceptance in the targeted application areas.

The interactive navigation through the graph poses new challenges to graph drawing algorithms. Whereas traditional graph drawing deals with the visualization of static graphs, we are now concerned with graphs that change over time, and the layout has to be adjusted in real time. The new layout has to observe aesthetic and application specific drawing criteria, as well as the preservation of the user's mental map; in particular only few changes in the layout are desired.

A similar dynamic component occurs in the visualization of graphs that evolve over time like minute-by-minute phone-call graphs which have application in police investigations. Here, we have a graph at each time point and an edge corresponds to a phone call between two telephones. In contrast to interactive navigation, we know in advance all of the changes the graph will undergo, and we can exploit this fact for producing a smoother animation sequence.

In summary, it is our impression that the participants enjoyed the great scientific atmosphere offered by Schloss Dagstuhl, and profited from the scientific program. We are grateful for having had the opportunity to organize this seminar. Special thanks are due to Carsten Gutwenger and Karsten Klein for their assistance in the organization and the running of the seminar.

  • Mario Albrecht (MPI für Informatik - Saarbrücken, DE)
  • Vladimir Batagelj (University of Ljubljana, SI)
  • Stephen P. Borgatti (University of Kentucky - Lexington, US)
  • Franz J. Brandenburg (Universität Passau, DE) [dblp]
  • Ulrik Brandes (Universität Konstanz, DE) [dblp]
  • Walter Didimo (University of Perugia, IT) [dblp]
  • Stephan Diehl (Universität Trier, DE) [dblp]
  • Tim Dwyer (Microsoft Corporation - Redmond, US) [dblp]
  • Michael English (University of Limerick, IE)
  • Alejandro Estrella-Balderrama (University of Arizona - Tucson, US)
  • Joe Fowler (University of Arizona - Tucson, US)
  • Emden R. Gansner (AT&T Labs Research - Florham Park, US) [dblp]
  • Markus Geyer (Universität Tübingen, DE)
  • Carsten Görg (Georgia Institute of Technology - Atlanta, US) [dblp]
  • Carsten Gutwenger (Technische Universität Dortmund, DE) [dblp]
  • Martin Harrigan (Trinity College Dublin, IE) [dblp]
  • Patrick Healy (University of Limerick, IE)
  • Seok-Hee Hong (The University of Sydney, AU) [dblp]
  • Michael Kaufmann (Universität Tübingen, DE) [dblp]
  • Andreas Kerren (Linnaeus University - Växjö, SE) [dblp]
  • Karsten Klein (TU Dortmund, DE) [dblp]
  • Stephen G. Kobourov (University of Arizona - Tucson, US) [dblp]
  • Oliver Kohlbacher (Universität Tübingen, DE) [dblp]
  • Lothar Krempel (MPI für Gesellschaftsforschung - Köln, DE) [dblp]
  • Ulrich Lauther (Siemens AG - München, DE) [dblp]
  • Giuseppe Liotta (University of Perugia, IT) [dblp]
  • Anna Lubiw (University of Waterloo, CA) [dblp]
  • Petra Mutzel (TU Dortmund, DE) [dblp]
  • Lev Nachmanson (Microsoft Research - Redmond, US) [dblp]
  • Nikola Nikolov (University of Limerick, IE)
  • Maurizio Patrignani (University of Rome III, IT) [dblp]
  • Wolfgang Paul (TU Dortmund, DE)
  • Aaron Quigley (University College Dublin, IE) [dblp]
  • Georg Sander (ILOG - Bad Homburg, DE)
  • Falk Schreiber (IPK Gatersleben, DE) [dblp]
  • Michael Schulz (Universität zu Köln, DE)
  • Dorothea Wagner (KIT - Karlsruher Institut für Technologie, DE) [dblp]
  • Hoi-Ming Wong (TU Dortmund, DE)
  • Michael Wybrow (Monash University - Clayton, AU) [dblp]
  • Idan Zohar (Tel Aviv University, IL)

Verwandte Seminare
  • Dagstuhl-Seminar 05191: Graph Drawing (2005-05-08 - 2005-05-13) (Details)
  • Dagstuhl-Seminar 11191: Graph Drawing with Algorithm Engineering Methods (2011-05-08 - 2011-05-13) (Details)
  • Dagstuhl-Seminar 15052: Empirical Evaluation for Graph Drawing (2015-01-25 - 2015-01-30) (Details)

  • computer graphics / visualization / human-computer-interaction

  • graph drawing
  • usability