國立虎尾科技大學 |

Guide to Graph Algorithms = Sequential, Parallel and Distributed /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Guide to Graph Algorithms/ by K Erciyes.
Reminder of title:	Sequential, Parallel and Distributed /
Author:	Erciyes, K.
Description:	XVIII, 471 p. 247 illus., 1 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-319-73235-0
ISBN:	9783319732350

Guide to Graph Algorithms = Sequential, Parallel and Distributed /
Erciyes, K.

Guide to Graph AlgorithmsSequential, Parallel and Distributed /[electronic resource] :by K Erciyes. - 1st ed. 2018. - XVIII, 471 p. 247 illus., 1 illus. in color.online resource. - Texts in Computer Science,1868-0941. - Texts in Computer Science,.

Introduction -- Part I: Fundamentals -- Introduction to Graphs -- Graph Algorithms -- Parallel Graph Algorithms -- Distributed Graph Algorithms -- Part II: Basic Graph Algorithms -- Trees and Graph Traversals -- Weighted Graphs -- Connectivity -- Matching -- Independence, Domination and Vertex Cover -- Coloring -- Part III: Advanced Topics -- Algebraic and Dynamic Graph Algorithms -- Analysis of Large Graphs -- Complex Networks -- Epilogue -- Appendix A: Pseudocode Conventions -- Appendix B: Linear Algebra Review.

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

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

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Guide to Graph Algorithms = Sequential, Parallel and Distributed /
LDR:03559nam a22004095i 4500 001 991646
003 DE-He213
005 20200706110459.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783319732350 $9 978-3-319-73235-0
024 7 $a 10.1007/978-3-319-73235-0 $2 doi
035 $a 978-3-319-73235-0
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
100 1 $a Erciyes, K. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1069227
245 1 0 $a Guide to Graph Algorithms $h [electronic resource] : $b Sequential, Parallel and Distributed / $c by K Erciyes.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a XVIII, 471 p. 247 illus., 1 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Texts in Computer Science, $x 1868-0941
505 0 $a Introduction -- Part I: Fundamentals -- Introduction to Graphs -- Graph Algorithms -- Parallel Graph Algorithms -- Distributed Graph Algorithms -- Part II: Basic Graph Algorithms -- Trees and Graph Traversals -- Weighted Graphs -- Connectivity -- Matching -- Independence, Domination and Vertex Cover -- Coloring -- Part III: Advanced Topics -- Algebraic and Dynamic Graph Algorithms -- Analysis of Large Graphs -- Complex Networks -- Epilogue -- Appendix A: Pseudocode Conventions -- Appendix B: Linear Algebra Review.
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 Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319732343
776 0 8 $i Printed edition: $z 9783319732367
776 0 8 $i Printed edition: $z 9783030103385
830 0 $a Texts in Computer Science, $x 1868-0941 $3 1254292
856 4 0 $u https://doi.org/10.1007/978-3-319-73235-0
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)