Theoretical Computer Science and General Issues

Algorithmics of Large and Complex Networks

Design, Analysis, and Simulation

Editors: Lerner, Jürgen, Wagner, Dorothea, Zweig, Katharina (Eds.)

Buy this book

eBook $59.99
price for USA (gross)
  • ISBN 978-3-642-02094-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $79.95
price for USA
  • ISBN 978-3-642-02093-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
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.

Table of contents (18 chapters)

  • Design and Engineering of External Memory Traversal Algorithms for General Graphs

    Ajwani, Deepak (et al.)

    Pages 1-33

  • Minimum Cycle Bases and Their Applications

    Berger, Franziska (et al.)

    Pages 34-49

  • A Survey on Approximation Algorithms for Scheduling with Machine Unavailability

    Diedrich, Florian (et al.)

    Pages 50-64

  • Iterative Compression for Exactly Solving NP-Hard Minimization Problems

    Guo, Jiong (et al.)

    Pages 65-80

  • Approaches to the Steiner Problem in Networks

    Polzin, Tobias (et al.)

    Pages 81-103

Buy this book

eBook $59.99
price for USA (gross)
  • ISBN 978-3-642-02094-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $79.95
price for USA
  • ISBN 978-3-642-02093-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Algorithmics of Large and Complex Networks
Book Subtitle
Design, Analysis, and Simulation
Editors
  • Jürgen Lerner
  • Dorothea Wagner
  • Katharina Zweig
Series Title
Theoretical Computer Science and General Issues
Series Volume
5515
Copyright
2009
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-02094-0
DOI
10.1007/978-3-642-02094-0
Softcover ISBN
978-3-642-02093-3
Edition Number
1
Number of Pages
X, 401
Topics