جهت دسترسی به کاربرگه ی زیر، از این لینک استفاده کنید. http://localhost/handle/Hannan/851
عنوان: Guide to Graph Algorithms
عنوان دیگر: Sequential, Parallel and Distributed /
پدیدآورنده: Erciyes, K. ;
کلید واژه ها: Computer Science;Algorithms;Computer Science and Mathematics;Computer Science;Algorithm Analysis and Problem Complexity. ;;Discrete Mathematics in Computer Science. ;;QA76.9.A43 ;
تاریخ انتشار: 2018
محل نشر: Cham :
ناشر: Springer International Publishing :
Imprint: Springer,
فروست / شماره : Texts in Computer Science, ; 1868-0941. ;
Texts in Computer Science, ; 1868-0941. ;
چکیده: 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 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. ;
توضیحات : SpringerLink (Online service) ;

005.1 ; 23 ;

Printed edition: ; 9783319732343. ;


آدرس: http://localhost/handle/Hannan/851
شابک : 9783319732350 ;
9783319732343 (print) ;
اطلاعات بیشتر: XVIII, 471 p. 247 illus., 1 illus. in color. ; online resource. ;
مجموعه(های):مدیریت فناوری اطلاعات

پیوست های این کاربرگه
فایل توضیحات اندازهفرمت  
9783319732343.pdf10.94 MBAdobe PDFتصویر
مشاهده فایل
عنوان: Guide to Graph Algorithms
عنوان دیگر: Sequential, Parallel and Distributed /
پدیدآورنده: Erciyes, K. ;
کلید واژه ها: Computer Science;Algorithms;Computer Science and Mathematics;Computer Science;Algorithm Analysis and Problem Complexity. ;;Discrete Mathematics in Computer Science. ;;QA76.9.A43 ;
تاریخ انتشار: 2018
محل نشر: Cham :
ناشر: Springer International Publishing :
Imprint: Springer,
فروست / شماره : Texts in Computer Science, ; 1868-0941. ;
Texts in Computer Science, ; 1868-0941. ;
چکیده: 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 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. ;
توضیحات : SpringerLink (Online service) ;

005.1 ; 23 ;

Printed edition: ; 9783319732343. ;


آدرس: http://localhost/handle/Hannan/851
شابک : 9783319732350 ;
9783319732343 (print) ;
اطلاعات بیشتر: XVIII, 471 p. 247 illus., 1 illus. in color. ; online resource. ;
مجموعه(های):مدیریت فناوری اطلاعات

پیوست های این کاربرگه
فایل توضیحات اندازهفرمت  
9783319732343.pdf10.94 MBAdobe PDFتصویر
مشاهده فایل
عنوان: Guide to Graph Algorithms
عنوان دیگر: Sequential, Parallel and Distributed /
پدیدآورنده: Erciyes, K. ;
کلید واژه ها: Computer Science;Algorithms;Computer Science and Mathematics;Computer Science;Algorithm Analysis and Problem Complexity. ;;Discrete Mathematics in Computer Science. ;;QA76.9.A43 ;
تاریخ انتشار: 2018
محل نشر: Cham :
ناشر: Springer International Publishing :
Imprint: Springer,
فروست / شماره : Texts in Computer Science, ; 1868-0941. ;
Texts in Computer Science, ; 1868-0941. ;
چکیده: 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 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. ;
توضیحات : SpringerLink (Online service) ;

005.1 ; 23 ;

Printed edition: ; 9783319732343. ;


آدرس: http://localhost/handle/Hannan/851
شابک : 9783319732350 ;
9783319732343 (print) ;
اطلاعات بیشتر: XVIII, 471 p. 247 illus., 1 illus. in color. ; online resource. ;
مجموعه(های):مدیریت فناوری اطلاعات

پیوست های این کاربرگه
فایل توضیحات اندازهفرمت  
9783319732343.pdf10.94 MBAdobe PDFتصویر
مشاهده فایل