Mohlo by se vám také líbit

Více informací o knize Handbook of Graph Theory, Combinatorial Optimization, and Algorithms

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 804 bodů

Anotace knihy

The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no book that currently covers both areas together. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified, comprehensive treatment of both graph theory and combinatorial optimization.

Divided into 11 cohesive sections, the handbook’s 44 chapters focus on graph theory, combinatorial optimization, and algorithmic issues. The book provides readers with the algorithmic and theoretical foundations to:

• Understand phenomena as shaped by their graph structures
• Develop needed algorithmic and optimization tools for the study of graph structures
• Design and plan graph structures that lead to certain desirable behavior

With contributions from more than 40 worldwide experts, this handbook equips readers with the necessary techniques and tools to solve problems in a variety of applications. Readers gain exposure to the theoretical and algorithmic foundations of a wide range of topics in graph theory and combinatorial optimization, enabling them to identify (and hence solve) problems encountered in diverse disciplines, such as electrical, communication, computer, social, transportation, biological, and other networks.

Parametry knihy

Zařazení knihy Knihy v angličtině Mathematics & science Mathematics Discrete mathematics

• Plný název: Handbook of Graph Theory, Combinatorial Optimization, and Algorithms
• Autor: Krishnaiyan Thulasiraman, S. Arumugam, Andreas Brandstadt, Tako Nishizeki
• Jazyk: Angličtina
• Vazba: Pevná
• Počet stran: 1226
• EAN: 9781584885955
• ISBN: 9781584885955
• ID: 02811546
• Nakladatelství: Taylor & Francis Inc
• Hmotnost: 3198 g
• Rozměry: 251 × 288 × 64 mm
• Datum vydání: 14. December 2015

Oblíbené z jiného soudku

---

---

---