|
![]() |
|||
|
||||
OverviewThis textbook discusses the design and implementation of basic algebraic graph algorithms, and algebraic graph algorithms for complex networks, employing matroids whenever possible. The text describes the design of a simple parallel matrix algorithm kernel that can be used for parallel processing of algebraic graph algorithms. Example code is presented in pseudocode, together with case studies in Python and MPI. The text assumes readers have a background in graph theory and/or graph algorithms. Full Product DetailsAuthor: K. ErciyesPublisher: Springer Nature Switzerland AG Imprint: Springer Nature Switzerland AG Edition: 1st ed. 2021 Weight: 0.367kg ISBN: 9783030878856ISBN 10: 3030878856 Pages: 221 Publication Date: 18 November 2021 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand ![]() We will order this item for you from a manufactured on demand supplier. Table of ContentsReviewsThe master's course 'Algorithms on graphs and networks' has become almost mandatory at most universities in the computer science department. The refereed manual may be the basis of such a course, including both lectures and practical training. (I. M. Erusalimskiy, zbMATH 1487.05001, 2022) Author InformationDr. 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. Tab Content 6Author Website:Countries AvailableAll regions |