Subramanian Arumugam – författare

This handbook is the first to present a unified, comprehensive treatment of graph theory, combinatorial optimization, and related algorithmic issues. It covers numerous topics of interest in applications in electrical, communication, computer, social, transportation, biological, and other networks. 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, and design and plan graph structures that lead to certain desirable behavior.

This handbook is the first to present a unified, comprehensive treatment of graph theory, combinatorial optimization, and related algorithmic issues. It covers numerous topics of interest in applications in electrical, communication, computer, social, transportation, biological, and other networks. 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, and design and plan graph structures that lead to certain desirable behavior.

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 structuresDevelop needed algorithmic and optimization tools for the study of graph structuresDesign 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.

This book constitutes the thoroughly referred post-workshop proceedings of the 23rd International Workshop on Combinatorial Algorithms, IWOCA 2012, held in Krishnankoil, Tamil Nadu, India, in July 2012.The 32 revised full papers presented were carefully reviewed and selected from a total of 88 submissions. The papers are organized in topical sections in algorithms and data Structures, applications (including Bioinformatics, Networking, etc.), combinatorics of words and strings, combinatorial optimization, combinatorial enumeration, decompositions and combinatorial designs, complexity theory (structural and computational), computational biology and graph theory and combinatorics submissions.