Cantitate/Preț
Produs
Total produse
Vezi coșul
Digraphs: Theory, Algorithms and Applications de Jørgen Bang-Jensen

Digraphs: Theory, Algorithms and Applications: Springer Monographs in Mathematics

Autor Jørgen Bang-Jensen, Gregory Z. Gutin
en Limba Engleză Hardback – 3 feb 2009
Substantially revised, reorganised and updated, the second edition 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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 70469 lei  6-8 săpt.
  SPRINGER LONDON – 28 sep 2010 70469 lei  6-8 săpt.
Hardback (1) 61258 lei  38-44 zile
  SPRINGER LONDON – 3 feb 2009 61258 lei  38-44 zile

Din seria Springer Monographs in Mathematics

  • 20% Fractal Geometry, Complex Dimensions and Zeta Functions: Geometry and Spectra of Fractal Strings
    Preț: 69600 lei
  • 24% Nonlinear Analysis - Theory and Methods
    Preț: 77743 lei
  • Unitals in Projective Planes
    Preț: 25265 lei
  • 20% Serre's Problem on Projective Modules
    Preț: 57469 lei
  • 18% Classes of Directed Graphs
    Preț: 95357 lei
  • 24% Comparison Finsler Geometry
    Preț: 74002 lei
  • 18% Geometric Aspects of General Topology
    Preț: 75321 lei
  • 20% Ergodic Theory: Independence and Dichotomies
    Preț: 81827 lei
  • 24% Functional Equations and Inequalities with Applications
    Preț: 159857 lei
  • Integral Closure: Rees Algebras, Multiplicities, Algorithms
    Preț: 61496 lei
  • 15% Symplectic Amalgams
    Preț: 63991 lei
  • Walsh Equiconvergence of Complex Interpolating Polynomials
    Preț: 38976 lei
  • 18% Some Nonlinear Problems in Riemannian Geometry
    Preț: 77976 lei
  • 15% Twelve Sporadic Groups
    Preț: 49137 lei
  • 18% Mathematical Topics Between Classical and Quantum Mechanics
    Preț: 121532 lei
  • Hausdorff Spectra in Functional Analysis
    Preț: 38506 lei
  • 18% Fixed Point Theory
    Preț: 138056 lei
  • 18% Groups Acting on Hyperbolic Space: Harmonic Analysis and Number Theory
    Preț: 78380 lei
  • 18% Elementary and Analytic Theory of Algebraic Numbers
    Preț: 90078 lei
  • Transformation of Measure on Wiener Space
    Preț: 39035 lei
  • 15% Strong Shape and Homology
    Preț: 64619 lei
  • 15% Elementary Dirichlet Series and Modular Forms
    Preț: 45993 lei
  • 15% Joins and Intersections
    Preț: 63716 lei
  • Normal Forms and Unfoldings for Local Dynamical Systems
    Preț: 39945 lei
  • Fourier Series in Control Theory
    Preț: 38336 lei
  • 18% An Introduction to the Mathematical Theory of the Navier-Stokes Equations: Steady-State Problems
    Preț: 96937 lei
  • 15% Classical Potential Theory
    Preț: 63860 lei
  • 15% Cyclotomic Fields and Zeta Values
    Preț: 57137 lei
  • 15% Algebraic Cobordism
    Preț: 63264 lei
  • 15% Geometry and Topology of Configuration Spaces
    Preț: 63683 lei
  • 18% Reciprocity Laws: From Euler to Eisenstein
    Preț: 88731 lei
  • 15% Nonstandard Analysis, Axiomatically
    Preț: 64233 lei
  • 18% Random Fields and Geometry
    Preț: 88666 lei
  • 18% Class Field Theory: From Theory to Practice
    Preț: 89196 lei
  • 18% Introduction to Tensor Products of Banach Spaces
    Preț: 87845 lei
  • 15% Moufang Polygons
    Preț: 64842 lei
  • 18% Random Dynamical Systems
    Preț: 78875 lei
  • 15% High-dimensional Knot Theory: Algebraic Surgery in Codimension 2
    Preț: 65019 lei
  • 15% The Heat Kernel and Theta Inversion on SL2(C)
    Preț: 63573 lei
  • On Some Aspects of the Theory of Anosov Systems: With a Survey by Richard Sharp: Periodic Orbits of Hyperbolic Flows
    Preț: 37805 lei
  • 15% Hardy Spaces on the Euclidean Space
    Preț: 69250 lei
  • 18% Set Theory: The Third Millennium Edition, revised and expanded
    Preț: 122711 lei
  • 18% Stratified Lie Groups and Potential Theory for Their Sub-Laplacians
    Preț: 101378 lei
  • Modern Methods in the Calculus of Variations: L^p Spaces
    Preț: 40229 lei
  • 15% Nonarchimedean Functional Analysis
    Preț: 62960 lei
  • 15% Notes on Coxeter Transformations and the McKay Correspondence
    Preț: 63251 lei
  • Iterative Methods for Queuing and Manufacturing Systems
    Preț: 38222 lei
  • 18% On Thom Spectra, Orientability, and Cobordism
    Preț: 94906 lei
  • 15% Local Multipliers of C*-Algebras
    Preț: 63797 lei
  • 15% Combinatorial Foundation of Homology and Homotopy: Applications to Spaces, Diagrams, Transformation Groups, Compactifications, Differential Algebras, Algebraic Theories, Simplicial Objects, and Resolutions
    Preț: 64037 lei

Preț: 61258 lei

Preț vechi: 76572 lei
-20% Nou

Puncte Express: 919
Preț estimativ în valută:
11723€ • 12213$ • 9747£

Carte tipărită la comandă

Livrare economică 06-12 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781848009974
ISBN-10: 1848009976
Pagini: 795
Ilustrații: XXII, 795 p.
Dimensiuni: 155 x 235 x 43 mm
Greutate: 1.26 kg
Ediția:2nd ed. 2009
Editura: SPRINGER LONDON
Colecția Springer
Seria Springer Monographs in Mathematics

Locul publicării:London, United Kingdom

Public țintă

Research

Cuprins

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.

Recenzii

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)

Textul de pe ultima copertă

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.

Caracteristici

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