國立虎尾科技大學 |

Algebraic Graph Algorithms = A Practical Guide Using Python /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Algebraic Graph Algorithms/ by K. Erciyes.
其他題名:	A Practical Guide Using Python /
作者:	Erciyes, K.
面頁冊數:	XIII, 221 p. 100 illus., 12 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematical Applications in Computer Science. -
電子資源:	https://doi.org/10.1007/978-3-030-87886-3
ISBN:	9783030878863

Algebraic Graph Algorithms = A Practical Guide Using Python /
Erciyes, K.

Algebraic Graph AlgorithmsA Practical Guide Using Python /[electronic resource] :by K. Erciyes. - 1st ed. 2021. - XIII, 221 p. 100 illus., 12 illus. in color.online resource. - Undergraduate Topics in Computer Science,2197-1781. - Undergraduate Topics in Computer Science,.

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.

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.

ISBN: 9783030878863

Standard No.: 10.1007/978-3-030-87886-3doiSubjects--Topical Terms:

815331
Mathematical Applications in Computer Science.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Algebraic Graph Algorithms = A Practical Guide Using Python /
LDR:03785nam a22003975i 4500 001 1057204
003 DE-He213
005 20211117134618.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030878863 $9 978-3-030-87886-3
024 7 $a 10.1007/978-3-030-87886-3 $2 doi
035 $a 978-3-030-87886-3
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
100 1 $a Erciyes, K. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1069227
245 1 0 $a Algebraic Graph Algorithms $h [electronic resource] : $b A Practical Guide Using Python / $c by K. Erciyes.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XIII, 221 p. 100 illus., 12 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Undergraduate Topics in Computer Science, $x 2197-1781
505 0 $a 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.
520 $a 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.
650 2 4 $a Mathematical Applications in Computer Science. $3 815331
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 0 $a Computer mathematics. $3 1199796
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Algorithms. $3 527865
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030878856
776 0 8 $i Printed edition: $z 9783030878870
830 0 $a Undergraduate Topics in Computer Science, $x 1863-7310 $3 1254738
856 4 0 $u https://doi.org/10.1007/978-3-030-87886-3
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)