
Digraphs
Theory, Algorithms and Applications
Springer (Publisher)
Published on 13. April 2001
Book
Hardback
XXII, 754 pages
978-1-85233-268-6 (ISBN)
Article exhausted; check for reprint
Description
The study of directed graphs (digraphs) has developed enormously over recent decades, yet the results are rather scattered across the journal literature. This is the first book to present a unified and comprehensive survey of the subject. In addition to covering the theoretical aspects, the authors discuss a large number of applications and their generalizations to topics such as the traveling salesman problem, project scheduling, genetics, network connectivity, and sparse matrices. Numerous exercises are included. For all graduate students, researchers and professionals interested in graph theory and its applications, this book will be essential reading.
More details
Series
Edition
1st Corrected ed. 2002. Corr. 3rd printing 0
Language
English
Place of publication
London
United Kingdom
Target group
College/higher education
Professional and scholarly
Illustrations
1
1 s/w Abbildung
184 illustrations, indexes
Dimensions
Height: 23.5 cm
Width: 15.5 cm
Weight
1260 gr
ISBN-13
978-1-85233-268-6 (9781852332686)
DOI
10.1007/978-1-4471-3886-0
Schweitzer Classification
Other editions
New editions

Book
02/2009
2nd Edition
Springer
€106.99
Shipment within 15-20 days
Additional editions

E-Book
06/2013
1st Edition
Springer
€99.99
Available for download
Content
1. Basic Terminology, Notation and Results.- 2. Distances.- 3. Flows in Networks.- 4. Classes of Digraphs.- 5. Hamiltonicity and Related Problems.- 6. Hamiltonian Refinements.- 7. Global Connectivity.- 8. Orientations of Graphs.- 9. Disjoint Paths and Trees.- 10. Cycle Structure of Digraphs.- 11. Generalizations of Digraphs.- 12. Additional Topics.- References.- Symbol Index.- Author Index.