Handbook of graph theory, combinatorial optimization, and algorithms. (2016)
- Record Type:
- Book
- Title:
- Handbook of graph theory, combinatorial optimization, and algorithms. (2016)
- Main Title:
- Handbook of graph theory, combinatorial optimization, and algorithms
- Further Information:
- Note: Krishnaiyan Thulasiraman, Subramanian Arumugam, Andreas Brandstädt, Takao Nishizeki.
- Authors:
- Thulasiraman, K
Arumugam, S, 1943-
Brandstädt, Andreas
Nishizeki, T (Takao), 1947- - Contents:
- Basic Concepts and Algorithms; Basic Concepts in Graph Theory and Algorithms; Subramanian Arumugam and Krishnaiyan "KT" Thulasiraman; Basic Graph Algorithms; Krishnaiyan "KT" Thulasiraman; Depth-First Search and Applications; Krishnaiyan "KT" Thulasiraman Flows in Networks; Maximum Flow Problem; F. Zeynep Sargut, Ravindra K. Ahuja, James B. Orlin, and Thomas L. Magnanti; Minimum Cost Flow Problem; Balachandran Vaidyanathan, Ravindra K. Ahuja, James B. Orlin, and Thomas L. Magnanti; Multi-Commodity Flows; Balachandran Vaidyanathan, Ravindra K. Ahuja, James B. Orlin, and Thomas L. Magnanti Algebraic Graph Theory; Graphs and Vector Spaces; Krishnaiyan "KT" Thulasiraman and M.N.S. Swamy; Incidence, Cut, and Circuit Matrices of a Graph; Krishnaiyan "KT" Thulasiraman and M.N.S. Swamy; Adjacency Matrix and Signal Flow Graphs; Krishnaiyan "KT" Thulasiraman and M.N.S. Swamy; Adjacency Spectrum and the Laplacian Spectrum of a Graph; R. Balakrishnan; Resistance Networks, Random Walks, and Network Theorems; Krishnaiyan "KT" Thulasiraman and Mamta Yadav Structural Graph Theory; Connectivity; Subramanian Arumugam and Karam Ebadi; Connectivity Algorithms; Krishnaiyan "KT" Thulasiraman; Graph Connectivity Augmentation; András Frank and Tibor Jordán; Matchings; Michael D. Plummer; Matching Algorithms; Krishnaiyan "KT" Thulasiraman; Stable Marriage Problem; Shuichi Miyazaki; Domination in Graphs; Subramanian Arumugam and M. Sundarakannan; Graph Colorings; Subramanian Arumugam and K. RajaBasic Concepts and Algorithms; Basic Concepts in Graph Theory and Algorithms; Subramanian Arumugam and Krishnaiyan "KT" Thulasiraman; Basic Graph Algorithms; Krishnaiyan "KT" Thulasiraman; Depth-First Search and Applications; Krishnaiyan "KT" Thulasiraman Flows in Networks; Maximum Flow Problem; F. Zeynep Sargut, Ravindra K. Ahuja, James B. Orlin, and Thomas L. Magnanti; Minimum Cost Flow Problem; Balachandran Vaidyanathan, Ravindra K. Ahuja, James B. Orlin, and Thomas L. Magnanti; Multi-Commodity Flows; Balachandran Vaidyanathan, Ravindra K. Ahuja, James B. Orlin, and Thomas L. Magnanti Algebraic Graph Theory; Graphs and Vector Spaces; Krishnaiyan "KT" Thulasiraman and M.N.S. Swamy; Incidence, Cut, and Circuit Matrices of a Graph; Krishnaiyan "KT" Thulasiraman and M.N.S. Swamy; Adjacency Matrix and Signal Flow Graphs; Krishnaiyan "KT" Thulasiraman and M.N.S. Swamy; Adjacency Spectrum and the Laplacian Spectrum of a Graph; R. Balakrishnan; Resistance Networks, Random Walks, and Network Theorems; Krishnaiyan "KT" Thulasiraman and Mamta Yadav Structural Graph Theory; Connectivity; Subramanian Arumugam and Karam Ebadi; Connectivity Algorithms; Krishnaiyan "KT" Thulasiraman; Graph Connectivity Augmentation; András Frank and Tibor Jordán; Matchings; Michael D. Plummer; Matching Algorithms; Krishnaiyan "KT" Thulasiraman; Stable Marriage Problem; Shuichi Miyazaki; Domination in Graphs; Subramanian Arumugam and M. Sundarakannan; Graph Colorings; Subramanian Arumugam and K. Raja Chandrasekar Planar Graphs; Planarity and Duality; Krishnaiyan "KT" Thulasiraman and M.N.S. Swamy; Edge Addition Planarity Testing Algorithm; John M. Boyer; Planarity Testing Based on PC-Trees; Wen-Lian Hsu; Graph Drawing; Md. Saidur Rahman and Takao Nishizeki Interconnection Networks; Introduction to Interconnection Networks; S.A. Choudum, Lavanya Sivakumar, and V. Sunitha; Cayley Graphs; S. Lakshmivarahan, Lavanya Sivakumar, and S.K. Dhall; Graph Embedding and Interconnection Networks; S.A. Choudum, Lavanya Sivakumar, and V. Sunitha Special Graphs; Program Graphs; Krishnaiyan "KT" Thulasiraman; Perfect Graphs; Chính T. Hoàng and R. Sritharan; Tree-Structured Graphs; Andreas Brandstädt and Feodor F. Dragan Partitioning; Graph and Hypergraph Partitioning; Sachin B. Patkar and H. Narayanan Matroids; Matroids; H. Narayanan and Sachin B. Patkar; Hybrid Analysis and Combinatorial Optimization; H. Narayanan Probabilistic Methods, Random Graph Models, and Randomized Algorithms; Probabilistic Arguments in Combinatorics; C.R. Subramanian; Random Models and Analyses for Chemical Graphs; Daniel Pascua, Tina M. Kouri, and Dinesh P. Mehta; Randomized Graph Algorithms: Techniques and Analysis; Surender Baswana and Sandeep Sen Coping with NP-Completeness; General Techniques for Combinatorial Approximation; Sartaj Sahni; ε-Approximation Schemes for the Constrained Shortest Path Problem; Krishnaiyan "KT" Thulasiraman; Constrained Shortest Path Problem: Lagrangian Relaxation-Based Algorithmic Approaches; Ying Xiao and Krishnaiyan "KT" Thulasiraman; Algorithms for Finding Disjoint Paths with QoS Constraints; Alex Sprintson and Ariel Orda; Set-Cover Approximation; Neal E. Young; Approximation Schemes for Fractional Multicommodity Flow Problems; George Karakostas; Approximation Algorithms for Connectivity Problems; Ramakrishna Thurimella; Rectilinear Steiner Minimum Trees; Tao Huang and Evangeline F.Y. Young; Fixed-Parameter Algorithms and Complexity; Venkatesh Raman and Saket Saurabh … (more)
- Edition:
- 1st
- Publisher Details:
- Boca Raton, Florida : Chapman & Hall/CRC
- Publication Date:
- 2016
- Extent:
- 1 online resource, illustrations (black and white)
- Subjects:
- 511.502462
Graph theory
Combinatorial optimization
Algorithms - Languages:
- English
- ISBNs:
- 9781420011074
- Notes:
- Note: Description based on CIP data; resource not viewed.
- Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.136968
- Ingest File:
- 02_047.xml