Skip to main content
SpringerLink
Log in

Algorithmics of Large and Complex Networks

Design, Analysis, and Simulation

  • Book
  • © 2009

Overview

Editors:
  1. Jürgen Lerner

    1. Department of Computer & Information Science, University of Konstanz, Konstanz, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Dorothea Wagner

    1. Institute of Theoretical Informatics, Technical University of Karlsruhe, Karlsruhe, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Katharina A. Zweig

    1. Department of Biological Physics, Eötvös Lorand University, Budapest, Hungary

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5515)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (18 chapters)

  1. Front Matter

    Download chapter PDF

  2. Network Algorithms

    1. Design and Engineering of External Memory Traversal Algorithms for General Graphs

      • Deepak Ajwani, Ulrich Meyer
      Pages 1-33

    2. Minimum Cycle Bases and Their Applications

      • Franziska Berger, Peter Gritzmann, Sven de Vries
      Pages 34-49

    3. A Survey on Approximation Algorithms for Scheduling with Machine Unavailability

      • Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz, Denis Trystram
      Pages 50-64

    4. Iterative Compression for Exactly Solving NP-Hard Minimization Problems

      • Jiong Guo, Hannes Moser, Rolf Niedermeier
      Pages 65-80

    5. Approaches to the Steiner Problem in Networks

      • Tobias Polzin, Siavash Vahdati-Daneshmand
      Pages 81-103

    6. A Survey on Multiple Objective Minimum Spanning Tree Problems

      • Stefan Ruzika, Horst W. Hamacher
      Pages 104-116

  3. Traffic Networks

    1. Engineering Route Planning Algorithms

      • Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner
      Pages 117-139

    2. From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future

      • Sven Grothklags, Ulf Lorenz, Burkhard Monien
      Pages 140-165

    3. Traffic Networks and Flows over Time

      • Ekkehard Köhler, Rolf H. Möhring, Martin Skutella
      Pages 166-196

  4. Communication Networks

    1. Interactive Communication, Diagnosis and Error Control in Networks

      • Rudolf Ahlswede, Harout Aydinian
      Pages 197-226

    2. Resource Management in Large Networks

      • Susanne Albers
      Pages 227-246

    3. Multicast Routing and Design of Sparse Connectors

      • Andreas Baltz, Anand Srivastav
      Pages 247-265

    4. Management of Variable Data Streams in Networks

      • Anja Feldmann, Simon Fischer, Nils Kammenhuber, Berthold Vöcking
      Pages 266-291

    5. Models of Non-atomic Congestion Games – From Unicast to Multicast Routing

      • Lasse Kliemann, Anand Srivastav
      Pages 292-318

    6. New Data Structures for IP Lookup and Conflict Detection

      • Christine Maindorfer, Tobias Lauer, Thomas Ottmann
      Pages 319-329

  5. Network Analysis and Simulation

    1. Group-Level Analysis and Visualization of Social Networks

      • Michael Baur, Ulrik Brandes, Jürgen Lerner, Dorothea Wagner
      Pages 330-358

    2. Modeling and Designing Real–World Networks

      • Michael Kaufmann, Katharina Zweig
      Pages 359-379

    3. Algorithms and Simulation Methods for Topology-Aware Sensor Networks

      • Alexander Kröller, Dennis Pfisterer, Sándor P. Fekete, Stefan Fischer
      Pages 380-400

  6. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • Department of Computer & Information Science, University of Konstanz, Konstanz, Germany

    Jürgen Lerner

  • Institute of Theoretical Informatics, Technical University of Karlsruhe, Karlsruhe, Germany

    Dorothea Wagner

  • Department of Biological Physics, Eötvös Lorand University, Budapest, Hungary

    Katharina A. Zweig

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation