# Handbook of graph theory, combinatorial optimization, and algorithms

##### Contributor(s): Thulasiraman, Krishnaiyan [Editor] | Arumugam, Subramanian [Editor] | Brandstadt, Andreas [Editor] | Nishizeki, Takao [Editor].

Material type: BookSeries: Chapman & Hall/CRC computer and information science series.Publisher: Boca Raton CRC Press 2016Description: xvii, 1226 p.ISBN: 9781584885955.Subject(s): Graph theory | Combinatorial optimization | AlgorithmsDDC classification: 511 Summary: 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. https://www.crcpress.com/Handbook-of-Graph-Theory-Combinatorial-Optimization-and-Algorithms/Thulasiraman-Arumugam-Brandstadt-Nishizeki/p/book/9781584885955Item type | Current location | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|---|

Books | Vikram Sarabhai Library General Stacks | Non-fiction | 511 H2 (Browse shelf) | Checked out | 20/06/2019 | 192907 |

Table of Contents

Basic Concepts and Algorithms

Basic Concepts in Graph Theory and Algorithms

Basic Graph Algorithms

Depth-First Search and Applications

Flows in Networks

Maximum Flow Problem

Minimum Cost Flow Problem

Multi-Commodity Flows

Algebraic Graph Theory

Graphs and Vector Spaces

Incidence, Cut, and Circuit Matrices of a Graph

Adjacency Matrix and Signal Flow Graphs

Adjacency Spectrum and the Laplacian Spectrum of a Graph

Resistance Networks, Random Walks, and Network Theorems

Structural Graph Theory

Connectivity

Connectivity Algorithms

Graph Connectivity Augmentation

Matchings

Matching Algorithms

Stable Marriage Problem

Domination in Graphs

Graph Colorings

Planar Graphs

Planarity and Duality

Edge Addition Planarity Testing Algorithm

Planarity Testing Based on PC-Trees

Graph Drawing

Interconnection Networks

Introduction to Interconnection Networks

Cayley Graphs

Graph Embedding and Interconnection Networks

Special Graphs

Program Graphs

Perfect Graphs

Tree-Structured Graphs

Partitioning

Graph and Hypergraph Partitioning

Matroids

Matroids

Hybrid Analysis and Combinatorial Optimization

Probabilistic Methods, Random Graph Models, and Randomized Algorithms

Probabilistic Arguments in Combinatorics

Random Models and Analyses for Chemical Graphs

Randomized Graph Algorithms: Techniques and Analysis

Coping with NP-Completeness

General Techniques for Combinatorial Approximation

ε-Approximation Schemes for the Constrained Shortest Path Problem

Constrained Shortest Path Problem: Lagrangian Relaxation-Based Algorithmic Approaches

Algorithms for Finding Disjoint Paths with QoS Constraints

Set-Cover Approximation

Approximation Schemes for Fractional Multicommodity Flow Problems

Approximation Algorithms for Connectivity Problems

Rectilinear Steiner Minimum Trees

Fixed-Parameter Algorithms and Complexity

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.

https://www.crcpress.com/Handbook-of-Graph-Theory-Combinatorial-Optimization-and-Algorithms/Thulasiraman-Arumugam-Brandstadt-Nishizeki/p/book/9781584885955

There are no comments for this item.