Handbook of Graph Theory, Combinatorial Optimization, and Algorithms

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.

Fuziunea dintre teoria graficelor si optimizarea combinatorie a dus la algoritmi teoretic profondi si practic utili, totusi nu exista nicio carte care sa acopere in prezent ambele zone impreuna. Manualul de teorie a graficelor, optimizarea combinatorie si algoritmi este primul care prezinta un tratament unificat si cuprinzator atat al teoriei graficelor, cat si al optimizarii combinatorii. Impartit in 11 sectiuni coezive, cele 44 de capitole ale manualului se concentreaza pe teoria graficelor, optimizarea combinatorie si problemele algoritmice.