Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Digraphs

Theory, Algorithms and Applications
BuchKartoniert, Paperback
795 Seiten
Englisch
Springererschienen am28.09.20102nd ed.
The new edition of this first book devoted to directed graphs has been substantially revised, reorganized and updated. With a strong focus on applications, it contains many new results and more than 650 exercises, 170 figures and 150 open problems.mehr
Verfügbare Formate
BuchKartoniert, Paperback
EUR120,50
BuchGebunden
EUR106,99
E-BookPDF1 - PDF WatermarkE-Book
EUR90,94
E-BookPDF1 - PDF WatermarkE-Book
EUR99,99

Produkt

KlappentextThe new edition of this first book devoted to directed graphs has been substantially revised, reorganized and updated. With a strong focus on applications, it contains many new results and more than 650 exercises, 170 figures and 150 open problems.
Zusammenfassung
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
Details
ISBN/GTIN978-0-85729-041-0
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr2010
Erscheinungsdatum28.09.2010
Auflage2nd ed.
ReiheSpringer Monographs in Mathematics
Seiten795 Seiten
SpracheEnglisch
Gewicht1246 g
IllustrationenXXII, 795 p.
Artikel-Nr.10013809

Inhalt/Kritik

Inhaltsverzeichnis
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.mehr
Kritik
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)mehr