LEADER 01144nam--2200385---450- 001 990001644620203316 005 20040510113020.0 010 $a88-7648-103-6 035 $a000164441 035 $aUSA01000164441 035 $a(ALEPH)000164462USA01 035 $a000164441 100 $a20040510d1990----km-y0itay0103----ba 101 $aita 102 $aIT 105 $a||||||||001yy 200 1 $a<> Purgatorio$ela notte lava la mente$edrammaturgia di un'ascensione$fMario Luzi$gpresentazione di Luigi Baldacci 210 $aGenova$cCosta & Nolan$d1990 215 $a81 p.$d20 cm 225 2 $a<>opera drammatica 410 0$12001$a<>opera drammatica 454 1$12001 461 1$1001-------$12001 606 0 $aLetteratura drammatica italoana$z1945- 676 $a852.914 700 1$aLUZI,$bMario$f<1914-2005>$0292831 702 1 $aBALDACCI,$bLuigi$f<1930-2002> 801 0$aIT$bsalbc$gISBD 912 $a990001644620203316 951 $a852.914 LUZ$b603 DLAS (bib.arte 910) 959 $aBK 969 $aDLAS 979 $aDLAS$b10$c20040510$lUSA01$h1130 996 $aPurgatorio$9943036 997 $aUNISA LEADER 04690nam 22006735 450 001 9910510574003321 005 20240708150732.0 010 $a9783030878863$b(electronic bk.) 010 $z9783030878856 024 7 $a10.1007/978-3-030-87886-3 035 $a(MiAaPQ)EBC6809651 035 $a(Au-PeEL)EBL6809651 035 $a(CKB)19919500900041 035 $a(OCoLC)1287135608 035 $a(DE-He213)978-3-030-87886-3 035 $a(PPN)258839597 035 $a(EXLCZ)9919919500900041 100 $a20211117d2021 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgebraic Graph Algorithms $eA Practical Guide Using Python /$fby K. Erciyes 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (229 pages) 225 1 $aUndergraduate Topics in Computer Science,$x2197-1781 311 08$aPrint version: Erciyes, K. Algebraic Graph Algorithms Cham : Springer International Publishing AG,c2021 9783030878856 327 $a1. 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. 330 $aThere 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. 410 0$aUndergraduate Topics in Computer Science,$x2197-1781 606 $aComputer science 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aTheory of Computation 606 $aDiscrete Mathematics in Computer Science 606 $aMathematical Applications in Computer Science 606 $aPython (Llenguatge de programació)$2thub 606 $aAlgorismes$2thub 606 $aÀlgebra$2thub 608 $aLlibres electrònics$2thub 615 0$aComputer science. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aTheory of Computation. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aMathematical Applications in Computer Science. 615 7$aPython (Llenguatge de programació) 615 7$aAlgorismes 615 7$aÀlgebra 676 $a511.5 700 $aErciyes$b Kayhan$01059880 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 912 $a9910510574003321 996 $aAlgebraic graph algorithms$92905029 997 $aUNINA