Graphs, Networks and Algorithms

Graphs, Networks and Algorithms

Dieter Jungnickel

130,64 €
IVA incluido
Consulta disponibilidad
Editorial:
Springer Nature B.V.
Año de edición:
2012
ISBN:
9783642322778

Selecciona una librería:

  • Librería Samer Atenea
  • Librería Aciertas (Toledo)
  • Kálamo Books
  • Librería Perelló (Valencia)
  • Librería Elías (Asturias)
  • Donde los libros
  • Librería Kolima (Madrid)
  • Librería Proteo (Málaga)

From the reviews of the previous editions '.... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ...' K.Engel, Mathematical Reviews 2002 The substantial development effort of this text, involving multiple editions and trailing in the context of various workshops, university courses and seminar series, clearly shows through in this new edition with its clear writing, good organisation, comprehensive coverage of essential theory, and well-chosen applications. The proofs of important results and the representation of key algorithms in a Pascal-like notation allow this book to be used in a high-level undergraduate or low-level graduate course on graph theory, combinatorial optimization or computer science algorithms. The well-worked solutions to exercises are a real bonus for self study by students. The book is highly recommended. P .B. Gibbons, Zentralblatt für Mathematik 2005 Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-completeness (especially on dominating sets), a section on the Gallai-Edmonds structure theory for matchings, and about a dozen additional exercises - as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof for the more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added.

Artículos relacionados

  • BEYOND THE TRIANGLE
    Kei Kobayashi / Marjorie Hahn / MARJORIE HAHN & KEI KOBAYA SABIR UMAROV / Sabir Umarov / UMAROV SABIR
     The book is devoted to the fundamental relationship between three objects: a stochastic process, stochastic differential equations driven by that process and their associated Fokker–Planck–Kolmogorov equations. This book discusses wide fractional generalizations of this fundamental triple relationship, where the driving process represents a time-changed stochastic process; the...
  • Topics in Mathematical Modeling
    K. K. Tung / Ka-Kit Tung
    Topics in Mathematical Modeling is an introductory textbook on mathematical modeling. The book teaches how simple mathematics can help formulate and solve real problems of current research interest in a wide range of fields, including biology, ecology, computer science, geophysics, engineering, and the social sciences. Yet the prerequisites are minimal: calculus and elementary ...
  • The Fascinating World of Graph Theory
    Arthur Benjamin / Gary Chartrand / Ping Zhang
    The history, formulas, and most famous puzzles of graph theoryGraph theory goes back several centuries and revolves around the study of graphs-mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathematics-and some of i...
    Disponible

    27,44 €

  • Dr. Euler’s Fabulous Formula
    Paul J. Nahin / Paul Nahin
    In the mid-eighteenth century, Swiss-born mathematician Leonhard Euler developed a formula so innovative and complex that it continues to inspire research, discussion, and even the occasional limerick. Dr. Euler’s Fabulous Formula shares the fascinating story of this groundbreaking formula-long regarded as the gold standard for mathematical beauty-and shows why it still lies at...
    Disponible

    31,49 €

  • ASPECTS OF COMPUTATION AND AUTOMATA THEORY WITH APPLICATIONS
    GREENBERG NOAM / SANJAY JAIN KENG MENG N NOAM GREENBERG
    This volume results from two programs that took place at the Institute for Mathematical Sciences at the National University of Singapore: Aspects of Computation - in Celebration of the Research Work of Professor Rod Downey (21 August to 15 September 2017) and Automata Theory and Applications: Games, Learning and Structures (20-24 September 2021).The first program was dedicated ...
  • Stability and Control of Large-Scale Dynamical Systems
    Sergey G. Nersesov / Wassim M. Haddad
    Modern complex large-scale dynamical systems exist in virtually every aspect of science and engineering, and are associated with a wide variety of physical, technological, environmental, and social phenomena, including aerospace, power, communications, and network systems, to name just a few. This book develops a general stability analysis and control design framework for nonli...

Otros libros del autor

  • Optimierungsmethoden
    Dieter Jungnickel
    Diskrete und kontinuierliche Methoden der mathematischen Optimierung werden in diesem Lehrbuch integriert behandelt. Nach einer Einführung werden konvexe Mengen (mit einer Anwendung auf notwendige Optimalitätsbedingungen bei Ungleichungsrestriktionen) behandelt, gefolgt von einer genaueren Betrachtung des Spezialfalls von Polyedern und dessen Zusammenhang zum Linearen Programm...
    Disponible

    35,52 €

  • Designs and Finite Geometries
    Dieter Jungnickel
    ...
    Disponible

    269,32 €

  • Graphs, Networks and Algorithms
    Dieter Jungnickel
    Basic Graph Theory.- Algorithms and Complexity.- Shortest Paths.- Spanning Trees.- The Greedy Algorithm.- Flows.- Combinatorial Applications.- Connectivity and Depth First Search.- Colorings.- Circulations.- The Network Simplex Algorithm.- Synthesis of Networks.- Matchings.- Weighted matchings.- A Hard Problem: The TSP. ...
    Disponible

    130,89 €

  • Designs and Finite Geometries
    Dieter Jungnickel
    Designs and Finite Geometries brings together in one place important contributions and up-to-date research results in this important area of mathematics. Designs and Finite Geometries serves as an excellent reference, providing insight into some of the most important research issues in the field. ...