LEADER 04550nam 22007575 450 001 9910502982803321 005 20240708161256.0 010 $a3-030-81885-3 024 7 $a10.1007/978-3-030-81885-2 035 $a(CKB)5140000000012974 035 $a(MiAaPQ)EBC6749153 035 $a(Au-PeEL)EBL6749153 035 $a(OCoLC)1276856013 035 $a(DE-He213)978-3-030-81885-2 035 $a(PPN)258296909 035 $a(EXLCZ)995140000000012974 100 $a20211011d2021 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms on Trees and Graphs $eWith Python Code /$fby Gabriel Valiente 205 $a2nd ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (392 pages) 225 1 $aTexts in Computer Science,$x1868-095X 311 $a3-030-81884-5 320 $aIncludes bibliographical references and index. 327 $a1. Introduction -- 2. Algorithmic Techniques -- 3. Tree Traversal -- 4. Tree Isomorphism -- 5. Graph Traversal -- 6. Clique, Independent Set, and Vertex Cover -- 7. Graph Isomorphism. 330 $aGraph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, like approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational biology, bioinformatics, and computational chemistry. This textbook introduces graph algorithms on an intuitive basis followed by a detailed exposition using structured pseudocode, with correctness proofs as well as worst-case analyses. Centered around the fundamental issue of graph isomorphism, the content goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. Numerous illustrations, examples, problems, exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference. Furthermore, Python code for all algorithms presented is given in an appendix. Topics and features: Algorithms are first presented on an intuitive basis, followed by a detailed exposition using structured pseudocode Correctness proofs are given, together with a worst-case analysis of the algorithms Full implementation of all the algorithms in Python An extensive chapter is devoted to the algorithmic techniques used in the book Solutions to all the problems Gabriel Valiente, PhD, is an accredited Full Professor at the Department of Computer Science and a member of the Algorithms, Bioinformatics, Complexity and Formal Methods Research Group of the Technical University of Catalonia in Barcelona, Spain. He has been lecturing on Data Structures and Algorithms at the undergraduate level and Advanced Graph Algorithms at the graduate level over the last several years. His current research is centered on combinatorial algorithms on graphs and, in particular, algorithms for comparing trees and graphs, with emphasis on algorithms in computational biology and bioinformatics. 410 0$aTexts in Computer Science,$x1868-095X 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aGraph theory 606 $aPython (Computer program language) 606 $aC++ (Computer program language) 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aGraph Theory 606 $aPython 606 $aC++ 606 $aTeoria de grafs$2thub 608 $aLlibres electrònics$2thub 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aGraph theory. 615 0$aPython (Computer program language) 615 0$aC++ (Computer program language). 615 14$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aGraph Theory. 615 24$aPython. 615 24$aC++. 615 7$aTeoria de grafs 676 $a511.5 700 $aValiente$b Gabriel$f1963-$0150887 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910502982803321 996 $aAlgorithms on trees and graphs$9474453 997 $aUNINA