Chapter 15. Optimal Dynamic Flows in Networks and Algorithms for Finding Them

  1. PD Dr. habil. Matthias Dehmer3,4,
  2. Prof. Dr. Frank Emmert-Streib5
  1. Dmitrii Lozovanu1,
  2. Maria Fonoberova2

Published Online: 21 AUG 2009

DOI: 10.1002/9783527627981.ch15

Book Title

Analysis of Complex Networks: From Biology to Linguistics

Analysis of Complex Networks: From Biology to Linguistics

Additional Information

How to Cite

Lozovanu, D. and Fonoberova, M. (2009) Optimal Dynamic Flows in Networks and Algorithms for Finding Them, in Analysis of Complex Networks: From Biology to Linguistics (eds M. Dehmer and F. Emmert-Streib), Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim, Germany. doi: 10.1002/9783527627981.ch15

Editor Information

  1. 3

    Vienna University of Technology, Discrete Mathematics and Geometry, Wiedner Hauptstraße 8–10, 1040 Vienna, Austria

  2. 4

    University of Coimbra, Center for Mathematics, Apartado 3008, 3001-454 Coimbra, Portugal

  3. 5

    Computational Biology and Machine Learning, Center for Cancer Research and Cell Biology, School of Medicine, Dentistry and Biomedical Sciences, Queen's University Belfast, 97 Lisburn Road, Belfast, BT9 7BL, UK

Author Information

  1. 1

    Moldovan Academy of Sciences, Institute of Mathematics and Computer Science, Academiei str., 5, Chisinau, MD-2005, Moldova

  2. 2

    AIMdyn, Inc., Santa Barbara, CA 93101, USA

Publication History

  1. Published Online: 21 AUG 2009
  2. Published Print: 22 APR 2009

ISBN Information

Print ISBN: 9783527323456

Online ISBN: 9783527627981

SEARCH

CHAPTER TOOLS

Get PDF (209K)

Keywords:

  • optimal dynamic flows;
  • networks;
  • algorithms

Summary

This chapter contains sections titled:

  • Introduction

  • Optimal Dynamic Single-Commodity Flow Problems and Algorithms for Solving Them

  • Optimal Dynamic Multicommodity Flow Problems and Algorithms for Solving Them

  • Conclusion

  • References

Get PDF (209K)