Guide to Graph Algorithms: Sequential, Parallel and Distributed (Softcover Reprint of the Original 1st 2018) ( Texts in Computer Science )
暫譯: 圖形演算法指南:序列、並行與分散式(2018年原版軟面再版)(計算機科學文本系列)
Erciyes, K (Author)
- 出版商: Clearview Investment
- 出版日期: 2019-02-01
- 定價: $2,100
- 售價: 8.0 折 $1,680
- 語言: 英文
- 頁數: 471
- 裝訂: paperback
- ISBN: 3030103382
- ISBN-13: 9783030103385
-
相關分類:
Algorithms-data-structures、Computer-Science
立即出貨 (庫存 < 3)
買這商品的人也買了...
-
$3,180$3,021 -
$2,970Algorithms for Functional Programming (Hardcover)
-
$340$289 -
$340$289 -
$320$272
商品描述
This clearly structured textbook/reference presents a detailed and comprehensive review of the fundamental principles of sequential graph algorithms, approaches for NP-hard graph problems, and approximation algorithms and heuristics for such problems. The work also provides a comparative analysis of sequential, parallel and distributed graph algorithms – including algorithms for big data – and an investigation into the conversion principles between the three algorithmic methods.
Topics and features: presents a comprehensive analysis of sequential graph algorithms; offers a unifying view by examining the same graph problem from each of the three paradigms of sequential, parallel and distributed algorithms; describes methods for the conversion between sequential, parallel and distributed graph algorithms; surveys methods for the analysis of large graphs and complex network applications; includes full implementation details for the problems presented throughout the text; provides additional supporting material at an accompanying website.
This practical guide to the design and analysis of graph algorithms is ideal for advanced and graduate students of computer science, electrical and electronic engineering, and bioinformatics. The material covered will also be of value to any researcher familiar with the basics of discrete mathematics, graph theory and algorithms.
商品描述(中文翻譯)
這本結構清晰的教科書/參考書詳細且全面地回顧了序列圖演算法的基本原則、NP-困難圖問題的解決方法,以及針對這些問題的近似演算法和啟發式演算法。本書還提供了序列、平行和分散圖演算法的比較分析,包括大數據的演算法,以及對這三種演算法方法之間轉換原則的探討。
主題與特色:全面分析序列圖演算法;通過從序列、平行和分散演算法的三種範式檢視相同的圖問題,提供統一的觀點;描述序列、平行和分散圖演算法之間的轉換方法;調查大型圖和複雜網路應用的分析方法;包括整個文本中所呈現問題的完整實作細節;提供附加的支援材料於伴隨的網站上。
這本實用的圖演算法設計與分析指南非常適合計算機科學、電氣與電子工程以及生物資訊學的高年級和研究生。所涵蓋的材料對於任何熟悉離散數學、圖論和演算法基礎的研究人員也將具有價值。
作者簡介
Dr. K. Erciyes is an Emeritus Professor of Computer Engineering at Ege University, Turkey. His other publications include the Springer titles Distributed Graph Algorithms for Computer Networks and Distributed and Sequential Algorithms for Bioinformatics.
作者簡介(中文翻譯)
K. Erciyes 博士是土耳其埃基大學計算機工程的名譽教授。他的其他出版物包括Springer的書籍計算機網絡的分佈式圖算法和生物信息學的分佈式與序列算法。