β Scribed by Arumugam, S.; BrandstΓ€dt, Andreas; Nishizeki, Takao; Thulasiraman, K
No coin nor oath required. For personal study only.
Content: Basic Concepts and AlgorithmsBasic Concepts in Graph Theory and AlgorithmsSubramanian Arumugam and Krishnaiyan "KT" ThulasiramanBasic Graph Algorithms Krishnaiyan "KT" ThulasiramanDepth-First Search and Applications Krishnaiyan "KT" ThulasiramanFlows in NetworksMaximum Flow Problem F. Zeynep Sargut, Ravindra K. Ahuja, James B. Orlin, and Thomas L. MagnantiMinimum Cost Flow Problem Balachandran Vaidyanathan, Ravindra K. Ahuja, James B. Orlin, and Thomas L. MagnantiMulti-Commodity Flows Balachandran Vaidyanathan, Ravindra K. Ahuja, James B. Orlin, and Thomas L. MagnantiAlgebraic Graph TheoryGraphs and Vector Spaces Krishnaiyan "KT" Thulasiraman and M.N.S. SwamyIncidence, Cut, and Circuit Matrices of a Graph Krishnaiyan "KT" Thulasiraman and M.N.S. SwamyAdjacency Matrix and Signal Flow Graphs Krishnaiyan "KT" Thulasiraman and M.N.S. SwamyAdjacency Spectrum and the Laplacian Spectrum of a Graph R. BalakrishnanResistance Networks, Random Walks, and Network Theorems Krishnaiyan "KT" Thulasiraman and Mamta YadavStructural Graph TheoryConnectivity Subramanian Arumugam and Karam EbadiConnectivity Algorithms Krishnaiyan "KT" ThulasiramanGraph Connectivity Augmentation Andras Frank and Tibor JordanMatchings Michael D. PlummerMatching Algorithms Krishnaiyan "KT" ThulasiramanStable Marriage Problem Shuichi MiyazakiDomination in Graphs Subramanian Arumugam and M. SundarakannanGraph Colorings Subramanian Arumugam and K. Raja ChandrasekarPlanar GraphsPlanarity and Duality Krishnaiyan "KT" Thulasiraman and M.N.S. SwamyEdge Addition Planarity Testing Algorithm John M. BoyerPlanarity Testing Based on PC-Trees Wen-Lian HsuGraph Drawing Md. Saidur Rahman and Takao NishizekiInterconnection NetworksIntroduction to Interconnection Networks S.A. Choudum, Lavanya Sivakumar, and V. SunithaCayley Graphs S. Lakshmivarahan, Lavanya Sivakumar, and S.K. DhallGraph Embedding and Interconnection Networks S.A. Choudum, Lavanya Sivakumar, and V. SunithaSpecial GraphsProgram Graphs Krishnaiyan "KT" ThulasiramanPerfect Graphs Chinh T. Hoang and R. SritharanTree-Structured Graphs Andreas Brandstadt and Feodor F. DraganPartitioningGraph and Hypergraph Partitioning Sachin B. Patkar and H. NarayananMatroidsMatroids H. Narayanan and Sachin B. PatkarHybrid Analysis and Combinatorial Optimization H. NarayananProbabilistic Methods, Random Graph Models, and Randomized AlgorithmsProbabilistic Arguments in Combinatorics C.R. SubramanianRandom Models and Analyses for Chemical Graphs Daniel Pascua, Tina M. Kouri, and Dinesh P. MehtaRandomized Graph Algorithms: Techniques and Analysis Surender Baswana and Sandeep SenCoping with NP-CompletenessGeneral Techniques for Combinatorial Approximation Sartaj SahniΓΒ΅-Approximation Schemes for the Constrained Shortest Path Problem Krishnaiyan "KT" ThulasiramanConstrained Shortest Path Problem: Lagrangian Relaxation-Based Algorithmic Approaches Ying Xiao and Krishnaiyan "KT" ThulasiramanAlgorithms for Finding Disjoint Paths with QoS Constraints Alex Sprintson and Ariel OrdaSet-Cover Approximation Neal E. YoungApproximation Schemes for Fractional Multicommodity Flow Problems George KarakostasApproximation Algorithms for Connectivity Problems Ramakrishna ThurimellaRectilinear Steiner Minimum Trees Tao Huang and Evangeline F.Y. YoungFixed-Parameter Algorithms and Complexity Venkatesh Raman and Saket Saurabh
Graph theory. Combinatorial optimization. Algorithms. MATHEMATICS / General
π SIMILAR VOLUMES
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,
This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by
<span>This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This