Digraphs: Theory, Algorithms and Applications (Google eBook)

Front Cover
Springer, Dec 17, 2008 - Mathematics - 820 pages
0 Reviews
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.
  

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Basic Terminology Notation and Results
1
Classes of Digraphs
31
Distances
87
Flows in Networks
127
Connectivity of Digraphs
191
Hamiltonian Longest and VertexCheapest Paths and Cycles
227
Restricted Hamiltonian Paths and Cycles
275
Paths and Cycles of Prescribed Lengths
307
Packings Coverings and Decompositions
505
Increasing Connectivity
553
Feedback Sets and Vertex Orderings
583
EdgeColoured Multigraphs
607
Applications of Digraphs and EdgeColoured Graphs
642
Algorithms and Their Complexity
695
References
721
Symbol Index
761

Branchings
339
Linkages in Digraphs
373
Orientations of Graphs and Digraphs
417
Sparse Subdigraphs with Prescribed Connectivity
479
Author Index
767
Subject Index
776
Copyright

Common terms and phrases

Bibliographic information