Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications
Catalogue Information
Field name Details
Dewey Class 511.6
Title Digraphs (EB) : Theory, Algorithms and Applications / by Jørgen Bang-Jensen, Gregory Z. Gutin.
Author Bang-Jensen, Jørgen
Added Personal Name Gutin, Gregory Z.
Other name(s) SpringerLink (Online service)
Publication London : Springer London , 2009.
Physical Details XXII, 798p. 175 illus. : online resource.
Series Springer monographs in mathematics 1439-7382
ISBN 9781848009981
Summary Note The theory of directed graphs has developed enormously over recent decades, yet this book (first published in 2000) remains the only book to cover more than a small fraction of the results. New research in the field has made a second edition a necessity. Substantially revised, reorganised and updated, the book 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. Digraphs is an essential, comprehensive reference for undergraduate and graduate students, and researchers in mathematics, operations research and computer science. It will also prove invaluable to specialists in related areas, such as meteorology, physics and computational biology. Jørgen Bang-Jensen is a Professor in the Department of Mathematics and Computer Science at the University of Southern Denmark, Odense, Denmark. Gregory Gutin is Professor of Computer Science at Royal Holloway College, University of London, UK.:
Contents note 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.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users).
Internet Site http://dx.doi.org/10.1007/978-1-84800-998-1
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Series:
Classification:
Catalogue Information 27533 Beginning of record . Catalogue Information 27533 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating27533
. E-mail This Page
Quick Search