Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/851
Full metadata record
DC FieldValueLanguage
dc.contributor.authorErciyes, K. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:22:41Z-
dc.date.available2020-05-17T08:22:41Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319732350 ;en_US
dc.identifier.isbn9783319732343 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/851-
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.description005.1 ; 23 ;en_US
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319732343. ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis 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 ee including algorithms for big data ee 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. Erciyeseis an emeritus professor of computer engineering at Ege University, Turkey. His other publications include the Springer titles Distributed Graph Algorithms for Computer Networks andeDistributed and Sequential Algorithms for Bioinformatics. ;en_US
dc.description.statementofresponsibilityby K Erciyes.en_US
dc.format.extentXVIII, 471 p. 247 illus., 1 illus. in color. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesTexts in Computer Science, ; 1868-0941. ;en_US
dc.relation.ispartofseriesTexts in Computer Science, ; 1868-0941. ;en_US
dc.relation.haspart9783319732343.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectAlgorithmsen_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectComputer Scienceen_US
dc.subjectAlgorithm Analysis and Problem Complexity. ;en_US
dc.subjectDiscrete Mathematics in Computer Science. ;en_US
dc.subject.lccQA76.9.A43 ;en_US
dc.titleGuide to Graph Algorithmsen_US
dc.title.alternativeSequential, Parallel and Distributed /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319732343.pdf10.94 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorErciyes, K. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:22:41Z-
dc.date.available2020-05-17T08:22:41Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319732350 ;en_US
dc.identifier.isbn9783319732343 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/851-
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.description005.1 ; 23 ;en_US
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319732343. ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis 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 ee including algorithms for big data ee 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. Erciyeseis an emeritus professor of computer engineering at Ege University, Turkey. His other publications include the Springer titles Distributed Graph Algorithms for Computer Networks andeDistributed and Sequential Algorithms for Bioinformatics. ;en_US
dc.description.statementofresponsibilityby K Erciyes.en_US
dc.format.extentXVIII, 471 p. 247 illus., 1 illus. in color. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesTexts in Computer Science, ; 1868-0941. ;en_US
dc.relation.ispartofseriesTexts in Computer Science, ; 1868-0941. ;en_US
dc.relation.haspart9783319732343.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectAlgorithmsen_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectComputer Scienceen_US
dc.subjectAlgorithm Analysis and Problem Complexity. ;en_US
dc.subjectDiscrete Mathematics in Computer Science. ;en_US
dc.subject.lccQA76.9.A43 ;en_US
dc.titleGuide to Graph Algorithmsen_US
dc.title.alternativeSequential, Parallel and Distributed /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319732343.pdf10.94 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorErciyes, K. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:22:41Z-
dc.date.available2020-05-17T08:22:41Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319732350 ;en_US
dc.identifier.isbn9783319732343 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/851-
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.description005.1 ; 23 ;en_US
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319732343. ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis 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 ee including algorithms for big data ee 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. Erciyeseis an emeritus professor of computer engineering at Ege University, Turkey. His other publications include the Springer titles Distributed Graph Algorithms for Computer Networks andeDistributed and Sequential Algorithms for Bioinformatics. ;en_US
dc.description.statementofresponsibilityby K Erciyes.en_US
dc.format.extentXVIII, 471 p. 247 illus., 1 illus. in color. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesTexts in Computer Science, ; 1868-0941. ;en_US
dc.relation.ispartofseriesTexts in Computer Science, ; 1868-0941. ;en_US
dc.relation.haspart9783319732343.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectAlgorithmsen_US
dc.subjectComputer Science and Mathematicsen_US
dc.subjectComputer Scienceen_US
dc.subjectAlgorithm Analysis and Problem Complexity. ;en_US
dc.subjectDiscrete Mathematics in Computer Science. ;en_US
dc.subject.lccQA76.9.A43 ;en_US
dc.titleGuide to Graph Algorithmsen_US
dc.title.alternativeSequential, Parallel and Distributed /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319732343.pdf10.94 MBAdobe PDFThumbnail
Preview File