Cargando…

Digraphs Theory, Algorithms and Applications /

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 update...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Bang-Jensen, Jørgen (Autor), Gutin, Gregory Z. (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: London : Springer London : Imprint: Springer, 2009.
Edición:2nd ed. 2009.
Colección:Springer Monographs in Mathematics,
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-1-84800-998-1
003 DE-He213
005 20220115071044.0
007 cr nn 008mamaa
008 100924s2009 xxk| s |||| 0|eng d
020 |a 9781848009981  |9 978-1-84800-998-1 
024 7 |a 10.1007/978-1-84800-998-1  |2 doi 
050 4 |a QA297.4 
072 7 |a PBD  |2 bicssc 
072 7 |a MAT008000  |2 bisacsh 
072 7 |a PBD  |2 thema 
082 0 4 |a 511.1  |2 23 
100 1 |a Bang-Jensen, Jørgen.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Digraphs  |h [electronic resource] :  |b Theory, Algorithms and Applications /  |c by Jørgen Bang-Jensen, Gregory Z. Gutin. 
250 |a 2nd ed. 2009. 
264 1 |a London :  |b Springer London :  |b Imprint: Springer,  |c 2009. 
300 |a XXII, 798 p. 175 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Springer Monographs in Mathematics,  |x 2196-9922 
505 0 |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. 
650 0 |a Discrete mathematics. 
650 0 |a Mathematical optimization. 
650 0 |a Calculus of variations. 
650 0 |a Algorithms. 
650 1 4 |a Discrete Mathematics. 
650 2 4 |a Optimization. 
650 2 4 |a Calculus of Variations and Optimization. 
650 2 4 |a Algorithms. 
700 1 |a Gutin, Gregory Z.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9781849968126 
776 0 8 |i Printed edition:  |z 9781848820074 
776 0 8 |i Printed edition:  |z 9780857290410 
776 0 8 |i Printed edition:  |z 9781848009974 
830 0 |a Springer Monographs in Mathematics,  |x 2196-9922 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-1-84800-998-1  |z Texto Completo 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713)