國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁 到查詢結果 [ subject:"Discrete Mathematics in Computer Science." ]

切換: 標籤 | MARC模式 | ISBD

Guide to graph algorithmssequential,...

Erciyes, K.

Guide to graph algorithmssequential, parallel and distributed /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Guide to graph algorithmsby K Erciyes.
其他題名:	sequential, parallel and distributed /
作者:	Erciyes, K.
出版者:	Cham :Springer International Publishing :2018.
面頁冊數:	xviii, 471 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer eBooks
標題:	Graph algorithms.
電子資源:	http://dx.doi.org/10.1007/978-3-319-73235-0
ISBN:	9783319732350$q(electronic bk.)

Guide to graph algorithmssequential, parallel and distributed /
Erciyes, K.

Guide to graph algorithmssequential, parallel and distributed /[electronic resource] :by K Erciyes. - Cham :Springer International Publishing :2018. - xviii, 471 p. :ill. (some col.), digital ;24 cm. - Texts in computer science,1868-0941. - Texts in computer science..

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

ISBN: 9783319732350$q(electronic bk.)

Standard No.: 10.1007/978-3-319-73235-0doiSubjects--Topical Terms:

455716
Graph algorithms.

LC Class. No.: QA166.245

Dewey Class. No.: 518.1

Guide to graph algorithmssequential, parallel and distributed /
LDR:02615nmm a2200313 a 4500 001 537660
003 DE-He213
005 20180413215744.0
006 m d
007 cr nn 008maaau
008 190116s2018 gw s 0 eng d
020 $a 9783319732350$q(electronic bk.)
020 $a 9783319732343$q(paper)
024 7 $a 10.1007/978-3-319-73235-0 $2 doi
035 $a 978-3-319-73235-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166.245
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 518.1 $2 23
090 $a QA166.245 $b .E65 2018
100 1 $a Erciyes, K. $3 731210
245 1 0 $a Guide to graph algorithms $h [electronic resource] : $b sequential, parallel and distributed / $c by K Erciyes.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xviii, 471 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Texts in computer science, $x 1868-0941
520 $a 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. 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.
650 0 $a Graph algorithms. $3 455716
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Texts in computer science. $3 559643
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-73235-0
950 $a Computer Science (Springer-11645)