04085nam a22004935i 4500 978-3-319-73235-0 DE-He213 20210628081120.0 cr nn 008mamaa 180413s2018 gw | s |||| 0|eng d 9783319732350 978-3-319-73235-0 10.1007/978-3-319-73235-0 doi QA76.9.A43 UMB bicssc COM051300 bisacsh UMB thema 005.1 23 Erciyes, K. author. aut http://id.loc.gov/vocabulary/relators/aut Guide to Graph Algorithms [electronic resource] : Sequential, Parallel and Distributed / by K Erciyes. 1st ed. 2018. Cham : Springer International Publishing : Imprint: Springer, 2018. XVIII, 471 p. 247 illus., 1 illus. in color. online resource. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Texts in Computer Science, 1868-0941 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. Algorithms. Computer science—Mathematics. Algorithm Analysis and Problem Complexity. https://scigraph.springernature.com/ontologies/product-market-codes/I16021 Discrete Mathematics in Computer Science. https://scigraph.springernature.com/ontologies/product-market-codes/I17028 SpringerLink (Online service) Springer Nature eBook Printed edition: 9783319732343 Printed edition: 9783319732367 Printed edition: 9783030103385 Texts in Computer Science, 1868-0941 https://doi.org/10.1007/978-3-319-73235-0 ZDB-2-SCS ZDB-2-SXCS Computer Science (SpringerNature-11645) Computer Science (R0) (SpringerNature-43710)