楼主: wwqqer
6984 140

[教材书籍] 经典教材系列 Handbook of Graph Theory, Combinatorial Optimization   [推广有奖]

回帖奖励 40 个论坛币 回复本帖可获得 1 个论坛币奖励! 每人限 1 次(中奖概率 30%)

版主

泰斗

65%

还不是VIP/贵宾

-

TA的文库  其他...

Wiley文库

Springer文库

全球著名CRC出版社文库

威望
17
论坛币
129807 个
通用积分
102409.9443
学术水平
5957 点
热心指数
6460 点
信用等级
5272 点
经验
3927 点
帖子
7502
精华
93
在线时间
9407 小时
注册时间
2007-12-10
最后登录
2024-4-27

二级伯乐勋章 一级伯乐勋章 初级学术勋章 中级学术勋章 初级热心勋章 中级热心勋章 初级信用勋章 中级信用勋章 高级学术勋章 高级热心勋章 特级学术勋章 高级信用勋章 特级信用勋章 特级热心勋章

楼主
wwqqer 在职认证  发表于 2016-5-22 08:47:59 |只看作者 |坛友微信交流群|倒序 |AI写论文
相似文件 换一批

+2 论坛币
k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群
赵安豆老师微信:zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

感谢您参与论坛问题回答

经管之家送您两个论坛币!

+2 论坛币
2015年最新教材,降价出售期已过,想要随时跟踪最新好书,请点击头像下方“加关注”。关注成功后,查看这里即可三步走把千本好书“一网打尽”!


Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified, comprehensive treatment of both graph theory and combinatorial optimization.


[相关阅读]
【经典教材系列】(资料汇总帖,附链接,持续添加中)



二维码

扫码加我 拉你入群

请注明:姓名-公司-职位

以便审核进群资格,未注明则拒绝

关键词:Optimization Algorithm handbook Theory Optim 阿尔法 华尔街 对冲基金 三步走 经典

handbookgraph.PNG (129.76 KB)

handbookgraph.PNG

Handbookgraph.pdf

14.76 MB

需要: 120 个论坛币  [购买]

高清pdf

本帖被以下文库推荐

沙发
onrush 发表于 2016-5-22 08:59:27 |只看作者 |坛友微信交流群
楼主 不太介绍 您上传的好资料!
我查了下儿,感觉确实好书:https://www.routledge.com/Handbo ... /book/9781584885955

Description
Contents
Authors
Series
Subjects
About the Book

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.

Table of 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. 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


已有 2 人评分经验 论坛币 学术水平 热心指数 信用等级 收起 理由
wwqqer + 100 + 3 + 3 热心帮助其他会员
shanghai8384 + 1 + 1 + 1 精彩帖子

总评分: 经验 + 100  论坛币 + 1  学术水平 + 1  热心指数 + 4  信用等级 + 3   查看全部评分

使用道具

藤椅
yangbing1008 发表于 2016-5-22 09:22:49 |只看作者 |坛友微信交流群
感谢分享

使用道具

板凳
yangke74 在职认证  发表于 2016-5-22 09:23:49 |只看作者 |坛友微信交流群
好书,支持一下

使用道具

报纸
yangke74 在职认证  发表于 2016-5-22 09:24:22 |只看作者 |坛友微信交流群
好书,支持一下

使用道具

地板
云游天外 发表于 2016-5-22 09:48:17 |只看作者 |坛友微信交流群
感谢分享!

使用道具

7
bbslover 发表于 2016-5-22 09:54:24 |只看作者 |坛友微信交流群
thanks it is good.

使用道具

8
li_mao 发表于 2016-5-22 10:04:36 |只看作者 |坛友微信交流群
看看

使用道具

9
ekscheng 发表于 2016-5-22 10:12:05 |只看作者 |坛友微信交流群

使用道具

10
pensifia 发表于 2016-5-22 10:55:54 |只看作者 |坛友微信交流群
Thanks for sharing

使用道具

您需要登录后才可以回帖 登录 | 我要注册

本版微信群
加JingGuanBbs
拉您进交流群

京ICP备16021002-2号 京B2-20170662号 京公网安备 11010802022788号 论坛法律顾问:王进律师 知识产权保护声明   免责及隐私声明

GMT+8, 2024-4-27 12:44