logo

EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link:  https://ebookbell.com/faq 


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Algebraic Graph Algorithms A Practical Guide Using Python K Erciyes

  • SKU: BELL-36346750
Algebraic Graph Algorithms A Practical Guide Using Python K Erciyes
$ 31.00 $ 45.00 (-31%)

4.4

82 reviews

Algebraic Graph Algorithms A Practical Guide Using Python K Erciyes instant download after payment.

Publisher: Springer
File Extension: PDF
File size: 3.08 MB
Pages: 234
Author: K. Erciyes
ISBN: 9783030878856, 3030878856
Language: English
Year: 2021

Product desciption

Algebraic Graph Algorithms A Practical Guide Using Python K Erciyes by K. Erciyes 9783030878856, 3030878856 instant download after payment.

There has been unprecedented growth in the study of graphs, which are discrete structures that have many real-world applications. The design and analysis of algebraic algorithms to solve graph problems have many advantages, such as implementing results from matrix algebra and using the already available matrix code for sequential and parallel processing.
Providing Python programming language code for nearly all algorithms, this accessible textbook focuses on practical algebraic graph algorithms using results from matrix algebra rather than algebraic study of graphs. Given the vast theory behind the algebraic nature of graphs, the book strives for an accessible, middle-ground approach by reviewing main algebraic results that are useful in designing practical graph algorithms on the one hand, yet mostly using graph matrices to solve the graph problems. Python is selected for its simplicity, efficiency and rich library routines; and with the code herein, brevity is forsaken for clarity.
Topics and features:
​Represents graphs by algebraic structures, enabling new, robust methods for algorithm analysis and design
Provides matroid-based solutions to some graph problems, including greedy algorithm problems
Offers Python code that can be tested and modified for various inputs
Supplies practical hints, where possible, for parallel processing associated with algebraic algorithms
Links to a web page with supportive materials
This clearly arranged textbook will be highly suitable for upper-level undergraduate students of computer science, electrical and electronic engineering, bioinformatics, and any researcher or person with background in discrete mathematics, basic graph theory and algorithms.
Dr. Kayhan Erciyes is a full Professor in the Department of Software Engineering at Maltepe University, Istanbul, Turkey. His other publications include the Springer titles Discrete Mathematics and Graph Theory, Distributed Real-Time Systems, Guide to Graph Algorithms, Distributed and Sequential Algorithms for Bioinformatics, and Distributed Graph Algorithms for Computer Networks.

Related Products