Digraphs: Theory, Algorithms and Applications
Author:   Jørgen Bang-Jensen ,  Gregory Z. Gutin
Publisher:   Springer London Ltd
Edition:   2nd ed. 2009
ISBN:  

9781848009974


Pages:   795
Publication Date:   03 February 2009
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $314.16 Quantity:  
Add to Cart

Share |

Digraphs: Theory, Algorithms and Applications


Add your own review!

Overview

Full Product Details

Author:   Jørgen Bang-Jensen ,  Gregory Z. Gutin
Publisher:   Springer London Ltd
Imprint:   Springer London Ltd
Edition:   2nd ed. 2009
Dimensions:   Width: 15.50cm , Height: 4.30cm , Length: 23.50cm
Weight:   1.388kg
ISBN:  

9781848009974


ISBN 10:   1848009976
Pages:   795
Publication Date:   03 February 2009
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

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.

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 fur 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. (Miklos Bona, 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)


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now