Table of contents

  1. Front Matter
  2. Network Algorithms

    1. Franziska Berger, Peter Gritzmann, Sven de Vries
      Pages 34-49
    2. Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz, Denis Trystram
      Pages 50-64
    3. Jiong Guo, Hannes Moser, Rolf Niedermeier
      Pages 65-80
    4. Tobias Polzin, Siavash Vahdati-Daneshmand
      Pages 81-103
    5. Stefan Ruzika, Horst W. Hamacher
      Pages 104-116
  3. Traffic Networks

    1. Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner
      Pages 117-139
    2. Sven Grothklags, Ulf Lorenz, Burkhard Monien
      Pages 140-165
    3. Ekkehard Köhler, Rolf H. Möhring, Martin Skutella
      Pages 166-196
  4. Communication Networks

    1. Rudolf Ahlswede, Harout Aydinian
      Pages 197-226
    2. Susanne Albers
      Pages 227-246
    3. Andreas Baltz, Anand Srivastav
      Pages 247-265
    4. Anja Feldmann, Simon Fischer, Nils Kammenhuber, Berthold Vöcking
      Pages 266-291
    5. Christine Maindorfer, Tobias Lauer, Thomas Ottmann
      Pages 319-329
  5. Network Analysis and Simulation

    1. Michael Baur, Ulrik Brandes, Jürgen Lerner, Dorothea Wagner
      Pages 330-358
    2. Michael Kaufmann, Katharina Zweig
      Pages 359-379
    3. Alexander Kröller, Dennis Pfisterer, Sándor P. Fekete, Stefan Fischer
      Pages 380-400
  6. Back Matter

About this book

Introduction

Networks play a central role in today’s society, since many sectors employing information technology, such as communication, mobility, and transport - even social interactions and political activities - are based on and rely on networks. In these times of globalization and the current global financial crisis with its complex and nearly incomprehensible entanglements of various structures and its huge effect on seemingly unrelated institutions and organizations, the need to understand large networks, their complex structures, and the processes governing them is becoming more and more important.

This state-of-the-art survey reports on the progress made in selected areas of this important and growing field, thus helping to analyze existing large and complex networks and to design new and more efficient algorithms for solving various problems on these networks since many of them have become so large and complex that classical algorithms are not sufficient anymore. This volume emerged from a research program funded by the German Research Foundation (DFG) consisting of projects focusing on the design of new discrete algorithms for large and complex networks. The 18 papers included in the volume present the results of projects realized within the program and survey related work. They have been grouped into four parts: network algorithms, traffic networks, communication networks, and network analysis and simulation.

Keywords

Analysis algorithmics algorithms approximation classification combinatorial optimization complexity theory computational complexity computational discrete mathematics computational geometry computational graph theory data mining distributed algorithms graph algori linear optimization

Editors and affiliations

  • Jürgen Lerner
    • 1
  • Dorothea Wagner
    • 2
  • Katharina A. Zweig
    • 3
  1. 1.Department of Computer & Information ScienceUniversity of KonstanzKonstanzGermany
  2. 2.Institute of Theoretical InformaticsTechnical University of KarlsruheKarlsruheGermany
  3. 3.Department of Biological PhysicsEötvös Lorand UniversityBudapestHungary

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-02094-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-02093-3
  • Online ISBN 978-3-642-02094-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book