Network Analysis

12-16 April 2004, Schloß Dagstuhl
Organizers: U. Brandes (Univ. Konstanz), T. Erlebach (ETH Zürich)

The term network analysis is used to encompass a broad spectrum of methods for analyzing relational structures. Current application examples are

as well as important topics within computer science such as program analysis and computer systems. Many formalized problems re-occur in different application areas, but they are dealt with independently and often only with a subject-specific mindset.

Thus, the goal of this seminar is to identify methods and problems that are relevant from a computer science perspective, and make them amenable to application-independent consideration. Our focus will be on graph-theoretic and algorithmic approaches; the various applications will serve as motivation, but will not be the main subject of interest.

  • Call for participation (in German, expired)
  • Participants
  • Program
  • Additional information for participants (restricted access)
  • Outcome: Springer LNCS 3418
  • About this Series

    Since 1997, the Gesellschaft für Informatik (GI) organizes research seminars on hot topics in computer science that are not appropriately represented in textbooks, yet. They are targeted at graduate students and recent PhDs who are interested in learning actively about new developments. Participants are selected mainly according to scientific qualification, i.e. not because of their special area of research, in order to widely spread such developments among academic institutions. The number of participants is typically limited to 20. So far, other GI-Dagstuhl-Seminars have been or are being organized on the following topics:

  • Game-Theoretic Analyses of the Internet
  • Model-based Testing of Reactive Systems
  • Validation of Stochastic Systems
  • Algorithms for Memory Hierarchies (2002, Springer LNCS 2625)
  • Automata, Logic and Infinite Games (2001, Springer LNCS 2500)
  • Graph Drawing (1999, Springer LNCS 2025)
  • Efficient Methods for Geometric Modelling and Scientific Visualization (1997, proceedings published with Teubner)
  • Proof Verification and Approximation Algorithms (1997, Springer LNCS 1367)

  • last modified 19 July 2016