Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Tag Display
Catalogue Tag Display
MARC 21
Digraphs: Theory, Algorithms and Applications
Tag
Description
020
$a9781848009981
082
$a511.6
099
$aOnline Resource: Springer
100
$aBang-Jensen, Jørgen
245
$aDigraphs$h[Ebook]$bTheory, Algorithms and Applications$cby Jørgen Bang-Jensen, Gregory Z. Gutin.
260
$aLondon$bSpringer$c2009.
300
$aXXII, 798 pages: 175 illus.$bonline resource.
336
$atext
338
$aonline resource
440
$aSpringer Monographs in Mathematics,$x1439-7382
505
$a
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.
520
$a
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.
538
$aOnline access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users).
700
$aGutin, Gregory Z.$eauthor.
710
$aSpringerLink (Online service)
830
$aSpringer Monographs in Mathematics,
856
$u
http://dx.doi.org/10.1007/978-1-84800-998-1
Quick Search
Search for