Handbook of Graph Theory, Combinatorial Optimization, and Algorithms
暫譯: 圖論、組合優化與演算法手冊

Thulasiraman, Krishnaiyan "kt", Arumugam, Subramanian, Brandstädt, Andreas

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms
  • 出版商: CRC
  • 出版日期: 2020-10-02
  • 售價: $2,090
  • 貴賓價: 9.5 折 $1,986
  • 語言: 英文
  • 頁數: 1226
  • 裝訂: Quality Paper - also called trade paper
  • ISBN: 0367575167
  • ISBN-13: 9780367575168
  • 相關分類: Algorithms-data-structures

    • 海外代購書籍(需單獨結帳)

商品描述

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.

 

 

商品描述(中文翻譯)

圖論與組合最佳化的融合產生了理論上深刻且實用的演算法，但目前尚無一本書同時涵蓋這兩個領域。《圖論、組合最佳化與演算法手冊》是首本提供圖論與組合最佳化統一且全面的處理的書籍。

本手冊分為11個緊密相關的部分，共44章，重點在於圖論、組合最佳化及演算法問題。該書為讀者提供了以下的演算法和理論基礎：

- 理解由其圖形結構所塑造的現象
- 開發研究圖形結構所需的演算法和最佳化工具
- 設計和規劃導致某些期望行為的圖形結構

本手冊匯集了來自全球40多位專家的貢獻，為讀者提供解決各種應用問題所需的技術和工具。讀者將接觸到圖論和組合最佳化中廣泛主題的理論和演算法基礎，使他們能夠識別（並因此解決）在電氣、通信、計算機、社會、交通、生物及其他網絡等多個學科中遇到的問題。

作者簡介

Editor-in-Chief
Krishnaiyan "KT" Thulasiraman is a professor and Hitachi Chair in Computer Science at the University of Oklahoma and a professor emeritus in electrical and computer engineering at Concordia University in Montreal. He is a fellow of the IEEE, AAAS, and the European Academy of Sciences. Dr. Thulasiraman has received several honors, including the Distinguished Alumnus Award of the Indian Institute of Technology Madras, IEEE Circuits and Systems Society Charles Desoer Technical Achievement Award, and IEEE Circuits and Systems Society Golden Jubilee Medal. He is the coauthor of two graduate-level textbooks on graphs, electrical networks, and algorithms. His research interests include graph theory, combinatorial optimization, and related algorithmic issues with a specific focus on applications in electrical and computer engineering and network science.

Editors
Subramanian Arumugam is a senior professor and director of the National Centre for Advanced Research in Discrete Mathematics at Kalasalingam University. He is also a visiting professor at Liverpool Hope University and an adjunct professor at Ball State University. Dr. Arumugam is the founding editor-in-chief of AKCE International Journal of Graphs and Combinatorics and author of 32 books and 195 journal papers. His current research interests include graph theory and its applications.

Andreas Brandstädt retired as a professor in computer science from the University of Rostock after 20 years. Dr. Brandstädt has published extensively in various international journals and conference proceedings. He is also the author of a textbook and coauthor of a widely cited monograph. His research interests include stochastics, complexity theory, formal languages, graph algorithms, graph theory, combinatorial optimization, and related algorithmic issues with a specific focus on efficient algorithms based on graph structure and graph classes with tree structure.

Takao Nishizeki is a professor emeritus at Tohoku University. He is a fellow of the ACM, IEEE, IEICE of Japan, Information Processing Society of Japan, and Bangladesh Academy of Sciences. Dr. Nishizeki has received several honors, including the Science and Technology Prize of the Japanese Ministry of Education, IEICE Achievement Award, ICF Best Research Award, Funai Information Science Promotion Award, TELECOM Technology Award, and many awards for best paper. His research interests include algorithms for planar graphs, edge coloring, network flows, VLSI routing, graph drawing, and cryptology.

作者簡介(中文翻譯)

編輯主任
Krishnaiyan "KT" Thulasiraman 是俄克拉荷馬大學計算機科學的教授及日立講座教授，同時也是蒙特利爾康考迪亞大學電機與計算機工程的名譽教授。他是IEEE、AAAS及歐洲科學院的院士。Thulasiraman博士曾獲得多項榮譽，包括印度理工學院馬德拉斯的傑出校友獎、IEEE電路與系統學會Charles Desoer技術成就獎及IEEE電路與系統學會金禧獎。他是兩本研究生級別教科書的共同作者，內容涵蓋圖論、電氣網絡及算法。他的研究興趣包括圖論、組合優化及相關的算法問題，特別專注於電氣與計算機工程及網絡科學的應用。

編輯
Subramanian Arumugam 是卡拉薩林甘大學離散數學高級研究國家中心的高級教授及主任。他同時也是利物浦霍普大學的訪問教授及巴爾州立大學的兼任教授。Arumugam博士是《AKCE國際圖形與組合學期刊》的創始主編，並著有32本書籍及195篇期刊論文。他目前的研究興趣包括圖論及其應用。

Andreas Brandstädt 在羅斯托克大學計算機科學系任教20年後退休。Brandstädt博士在各種國際期刊及會議論文集中發表了大量作品。他也是一本教科書的作者及一部廣泛引用的專著的共同作者。他的研究興趣包括隨機過程、複雜性理論、形式語言、圖算法、圖論、組合優化及相關的算法問題，特別專注於基於圖結構及樹結構的高效算法。

Takao Nishizeki 是東北大學的名譽教授。他是ACM、IEEE、日本IEICE、日本信息處理學會及孟加拉科學院的院士。Nishizeki博士曾獲得多項榮譽，包括日本文部科學省的科學與技術獎、IEICE成就獎、ICF最佳研究獎、Funai信息科學推廣獎、TELECOM技術獎及多項最佳論文獎。他的研究興趣包括平面圖的算法、邊著色、網絡流、VLSI路由、圖形繪製及密碼學。

類似商品

最後瀏覽商品 (1)