Digraphs

Theory, Algorithms and Applications

  • Authors
  • Jørgen Bang-Jensen
  • Gregory Z. Gutin

Part of the Springer Monographs in Mathematics book series (SMM)

Table of contents

  1. Front Matter
    Pages i-xxii
  2. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 1-30
  3. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 31-86
  4. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 87-126
  5. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 127-190
  6. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 191-226
  7. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 227-274
  8. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 275-305
  9. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 307-338
  10. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 339-372
  11. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 373-416
  12. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 417-478
  13. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 479-504
  14. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 505-552
  15. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 553-582
  16. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 583-606
  17. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 607-641
  18. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 643-694
  19. Jørgen Bang-Jensen, Gregory Z. Gutin
    Pages 695-720
  20. Back Matter
    Pages 721-795

About this book

Introduction

The theory of directed graphs has developed enormously over recent decades, yet this book (first published in 2000) remains the only book to cover more than a small fraction of the results. New research in the field has made a second edition a necessity.

Substantially revised, reorganised and updated, the book now comprises eighteen chapters, carefully arranged in a straightforward and logical manner, with many new results and open problems.

As well as covering the theoretical aspects of the subject, with detailed proofs of many important results, the authors present a number of algorithms, and whole chapters are devoted to topics such as branchings, feedback arc and vertex sets, connectivity augmentations, sparse subdigraphs with prescribed connectivity, and also packing, covering and decompositions of digraphs. Throughout the book, there is a strong focus on applications which include quantum mechanics, bioinformatics, embedded computing, and the travelling salesman problem.

Detailed indices and topic-oriented chapters ease navigation, and more than 650 exercises, 170 figures and 150 open problems are included to help immerse the reader in all aspects of the subject.

Digraphs is an essential, comprehensive reference for undergraduate and graduate students, and researchers in mathematics, operations research and computer science. It will also prove invaluable to specialists in related areas, such as meteorology, physics and computational biology.

Jørgen Bang-Jensen is a Professor in the Department of Mathematics and Computer Science at the University of Southern Denmark, Odense, Denmark.

Gregory Gutin is Professor of Computer Science at Royal Holloway College, University of London, UK.

Keywords

Graph Hamiltonian cycle Hamiltonian path Hypergraph Sim Vertex algorithms linear optimization operations research

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-84800-998-1
  • Copyright Information Springer-Verlag London Limited 2009
  • Publisher Name Springer, London
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-0-85729-041-0
  • Online ISBN 978-1-84800-998-1
  • Series Print ISSN 1439-7382
  • About this book