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.
Rezensionen / Stimmen
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)
Reihe
Auflage
Sprache
Verlagsort
Zielgruppe
Für Beruf und Forschung
Research
Editions-Typ
Illustrationen
Maße
Höhe: 241 mm
Breite: 160 mm
Dicke: 50 mm
Gewicht
ISBN-13
978-1-84800-997-4 (9781848009974)
DOI
10.1007/978-1-84800-998-1
Schweitzer Klassifikation
Basic Terminology, Notation and Results.- Classes of Digraphs.- Distances.- Flows in Networks.- Connectivity of Digraphs.- Hamiltonian, Longest and Vertex-Cheapest Paths and Cycles.- Restricted Hamiltonian Paths and Cycles.- Paths and Cycles of Prescribed Lengths.- Branchings.- Linkages in Digraphs.- Orientations of Graphs and Digraphs.- Sparse Subdigraphs with Prescribed Connectivity.- Packings, Coverings and Decompositions.- Increasing Connectivity.- Feedback Sets and Vertex Orderings.- Generalizations of Digraphs: Edge-Coloured Multigraphs.- Applications of Digraphs and Edge-Coloured Graphs.- Algorithms and Their Complexity.
