國立高雄大學圖資館 |

Language: English

Back

Algorithms on trees and graphswith P...

SpringerLink (Online service)

Algorithms on trees and graphswith Python code /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Algorithms on trees and graphsby Gabriel Valiente.
Reminder of title:	with Python code /
Author:	Valiente, Gabriel,
Published:	Cham :Springer International Publishing :2021.
Description:	xv, 387 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Graph algorithms.
Online resource:	https://doi.org/10.1007/978-3-030-81885-2
ISBN:	9783030818852$q(electronic bk.)

Algorithms on trees and graphswith Python code /
Valiente, Gabriel,1963-.

Algorithms on trees and graphswith Python code /[electronic resource] :by Gabriel Valiente. - Second edition. - Cham :Springer International Publishing :2021. - xv, 387 p. :ill., digital ;24 cm. - Texts in computer science,1868-095X. - Texts in computer science..

1. Introduction -- 2. Algorithmic Techniques -- 3. Tree Traversal -- 4. Tree Isomorphism -- 5. Graph Traversal -- 6. Clique, Independent Set, and Vertex Cover -- 7. Graph Isomorphism.

Graph 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.

ISBN: 9783030818852$q(electronic bk.)

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

455716
Graph algorithms.

LC Class. No.: QA166.245 / .V35 2021

Dewey Class. No.: 518.1

Algorithms on trees and graphswith Python code /
LDR:03361nmm a2200361 a 4500 001 610432
003 DE-He213
005 20211011100708.0
006 m d
007 cr nn 008maaau
008 220330s2021 sz s 0 eng d
020 $a 9783030818852$q(electronic bk.)
020 $a 9783030818845$q(paper)
024 7 $a 10.1007/978-3-030-81885-2 $2 doi
035 $a 978-3-030-81885-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166.245 $b .V35 2021
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a PBD $2 thema
072 7 $a UYAM $2 thema
082 0 4 $a 518.1 $2 23
090 $a QA166.245 $b .V172 2021
100 1 $a Valiente, Gabriel, $d 1963-. $3 908492
245 1 0 $a Algorithms on trees and graphs $h [electronic resource] : $b with Python code / $c by Gabriel Valiente.
250 $a Second edition.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xv, 387 p. : $b ill., digital ; $c 24 cm.
490 1 $a Texts in computer science, $x 1868-095X
505 0 $a 1. Introduction -- 2. Algorithmic Techniques -- 3. Tree Traversal -- 4. Tree Isomorphism -- 5. Graph Traversal -- 6. Clique, Independent Set, and Vertex Cover -- 7. Graph Isomorphism.
520 $a Graph 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.
650 0 $a Graph algorithms. $3 455716
650 1 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Algorithms. $3 184661
650 2 4 $a Graph Theory. $3 522732
650 2 4 $a Python. $3 763308
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 274102
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Texts in computer science. $3 559643
856 4 0 $u https://doi.org/10.1007/978-3-030-81885-2
950 $a Computer Science (SpringerNature-11645)