Overview
- First book devoted to directed graphs
- Includes applications and numerous examples
- Includes many exercises
- New edition features the developments over the last six years and contains a large number of open problems with sufficient background information to allow researchers to attack these problems
- Includes supplementary material: sn.pub/extras
Part of the book series: Springer Monographs in Mathematics (SMM)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (18 chapters)
-
Front Matter
-
Back Matter
Keywords
About this book
Substantially revised, reorganised and updated, the second edition 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.
Reviews
From the reviews:
"Digraphs (directed graphs) are a long-standing and important field of graph theory. Nevertheless, this is the first comprehensive monograph devoted to the subject. As a handbook, it addresses various groups of readers (students as well as researchers, and from various areas of applications). Throughout, because of their importance for applications, emphasis is on algorithms (in form of constructive proofs whenever possible). … a valuable and indispensable reference for many years to come. Readers and users will be thankful!" (P. Schmitt, Monatshefte für Mathematik, Vol. 141 (1), 2004)
From the reviews of the second edition:
"This is a very comprehensive volume on directed graphs and related topics. … an excellent reference. … the book will be useful not just for researchers focusing on digraphs, but also for everyone … . an extensive list of conjectures and open questions is included in every chapter. These are typically very well presented and easy to understand." (Miklós Bóna, MAA Online, February, 2009)
“The first edition of this book was published in 2000 … . The area has continued to develop and this reorganized and updated edition contains an additional six chapters … . there is a strong emphasis on algorithms, and constructive proofs are given whenever possible. There are more than 650 exercises and 150 open problems and conjectures. … the bibliography contains 934 items and the author index contains 740 names. This book would be a valuable resource for anyone interested in digraphs and their applications.” (J. W. Moon, Zentralblatt MATH, Vol. 1170, 2009)
Bibliographic Information
Book Title: Digraphs
Book Subtitle: Theory, Algorithms and Applications
Authors: Jørgen Bang-Jensen, Gregory Z. Gutin
Series Title: Springer Monographs in Mathematics
DOI: https://doi.org/10.1007/978-1-84800-998-1
Publisher: Springer London
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer-Verlag London Limited 2009
Hardcover ISBN: 978-1-84800-997-4Published: 03 February 2009
Softcover ISBN: 978-0-85729-041-0Published: 28 September 2010
eBook ISBN: 978-1-84800-998-1Published: 17 December 2008
Series ISSN: 1439-7382
Series E-ISSN: 2196-9922
Edition Number: 2
Number of Pages: XXII, 795
Topics: Discrete Mathematics, Combinatorics, Optimization, Calculus of Variations and Optimal Control; Optimization, Algorithms, Algorithm Analysis and Problem Complexity