Zur Startseite gehen
0,00 €*
Cover: 9783030878856 | Algebraic Graph Algorithms | A Practical Guide Using Python | Erciyes
Dekorationsartikel gehören nicht zum Leistungsumfang.
Algebraic Graph Algorithms
A Practical Guide Using Python
Taschenbuch von K. Erciyes
Sprache: Englisch

47,70 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 1-2 Wochen

Kategorien:
Beschreibung
This 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.
This 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.
Über den Autor
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.
Zusammenfassung

Represents graphs by algebraic structures, enabling new, robust methods for algorithm analysis and design

Provides matroid-based solutions to graph problems, including greedy algorithm problems

Discusses algebraic graph algorithms for complex networks, showing parallel implementations

Inhaltsverzeichnis
1. Introduction.- 2. Graphs, Matrices and Matroids.- 3. Parallel Matrix Algorithm Kernel.- 4. Basic Graph Algorithms.- 5. Connectivity, Matching and Matroids.- 6. Subgraph Search.- 7. Analysis of Large Graphs.- 8. Clustering in Complex Networks.- 9. Kronecker Graphs.- 10. Sample Algorithms for Complex Networks.
Details
Erscheinungsjahr: 2021
Genre: Informatik, Mathematik, Medizin, Naturwissenschaften, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Undergraduate Topics in Computer Science
Inhalt: xiii
221 S.
88 s/w Illustr.
12 farbige Illustr.
221 p. 100 illus.
12 illus. in color.
ISBN-13: 9783030878856
ISBN-10: 3030878856
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Erciyes, K.
Auflage: 1st ed. 2021
Hersteller: Springer International Publishing
Springer International Publishing AG
Undergraduate Topics in Computer Science
Verantwortliche Person für die EU: Books on Demand GmbH, In de Tarpen 42, D-22848 Norderstedt, info@bod.de
Maße: 235 x 155 x 13 mm
Von/Mit: K. Erciyes
Erscheinungsdatum: 18.11.2021
Gewicht: 0,365 kg
Artikel-ID: 120488535
Über den Autor
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.
Zusammenfassung

Represents graphs by algebraic structures, enabling new, robust methods for algorithm analysis and design

Provides matroid-based solutions to graph problems, including greedy algorithm problems

Discusses algebraic graph algorithms for complex networks, showing parallel implementations

Inhaltsverzeichnis
1. Introduction.- 2. Graphs, Matrices and Matroids.- 3. Parallel Matrix Algorithm Kernel.- 4. Basic Graph Algorithms.- 5. Connectivity, Matching and Matroids.- 6. Subgraph Search.- 7. Analysis of Large Graphs.- 8. Clustering in Complex Networks.- 9. Kronecker Graphs.- 10. Sample Algorithms for Complex Networks.
Details
Erscheinungsjahr: 2021
Genre: Informatik, Mathematik, Medizin, Naturwissenschaften, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Undergraduate Topics in Computer Science
Inhalt: xiii
221 S.
88 s/w Illustr.
12 farbige Illustr.
221 p. 100 illus.
12 illus. in color.
ISBN-13: 9783030878856
ISBN-10: 3030878856
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Erciyes, K.
Auflage: 1st ed. 2021
Hersteller: Springer International Publishing
Springer International Publishing AG
Undergraduate Topics in Computer Science
Verantwortliche Person für die EU: Books on Demand GmbH, In de Tarpen 42, D-22848 Norderstedt, info@bod.de
Maße: 235 x 155 x 13 mm
Von/Mit: K. Erciyes
Erscheinungsdatum: 18.11.2021
Gewicht: 0,365 kg
Artikel-ID: 120488535
Sicherheitshinweis

Ähnliche Produkte

Diese Website verwendet Cookies, um eine bestmögliche Erfahrung bieten zu können. Mehr Informationen ...