Guide to Graph Algorithms Sequential, Parallel and Distributed /

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

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Erciyes, K. (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2018.
Έκδοση:1st ed. 2018.
Σειρά:Texts in Computer Science,
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04017nam a2200481 4500
001 978-3-319-73235-0
003 DE-He213
005 20200219012928.0
007 cr nn 008mamaa
008 180413s2018 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 
040 |d GrThAP 
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.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
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. 
650 0 |a Computer science-Mathematics. 
650 1 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
650 2 4 |a Discrete Mathematics in Computer Science.  |0 http://scigraph.springernature.com/things/product-market-codes/I17028 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
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 
856 4 0 |u https://doi.org/10.1007/978-3-319-73235-0  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645)