Algorithms on Trees and Graphs (Record no. 177795)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04381nam a22006375i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-030-81885-2 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240423125426.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 211011s2021 sz | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783030818852 |
| -- | 978-3-030-81885-2 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/978-3-030-81885-2 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA76.9.M35 |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA297.4 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYAM |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | PBD |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | COM014000 |
| Source | bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYAM |
| Source | thema |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | PBD |
| Source | thema |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.0151 |
| Edition number | 23 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Valiente, Gabriel. |
| Relator term | author. |
| Relator code | aut |
| -- | http://id.loc.gov/vocabulary/relators/aut |
| 245 10 - TITLE STATEMENT | |
| Title | Algorithms on Trees and Graphs |
| Medium | [electronic resource] : |
| Remainder of title | With Python Code / |
| Statement of responsibility, etc | by Gabriel Valiente. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 2nd ed. 2021. |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2021. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | XV, 387 p. 145 illus. |
| Other physical details | online resource. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | Texts in Computer Science, |
| International Standard Serial Number | 1868-095X |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 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 ## - SUMMARY, ETC. | |
| Summary, etc | 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 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science |
| General subdivision | Mathematics. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Discrete mathematics. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Graph theory. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Python (Computer program language). |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | C++ (Computer program language). |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Discrete Mathematics in Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Graph Theory. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Python. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | C++. |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer Nature eBook |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783030818845 |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783030818869 |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783030818876 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Texts in Computer Science, |
| -- | 1868-095X |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://doi.org/10.1007/978-3-030-81885-2">https://doi.org/10.1007/978-3-030-81885-2</a> |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-SXCS |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks-CSE-Springer |
No items available.