Graph Theory for Programmers: Algorithms for Processing Trees: 515 - Rilegato

Kasyanov, Victor N.; Evstigneev, Vladimir A.

 
9780792364283: Graph Theory for Programmers: Algorithms for Processing Trees: 515

Sinossi

This introductory book treats algorithmic graph theory specifically for programmers. It explores some key ideas and basic algorithms in this growing field, and contains high-level and language-independent descriptions of methods and algorithms on trees, the most important type of graphs in programming and informatics. Readers are assumed to be familiar with the basics of graph theory, and programming. The volume should be of interest to researchers and specialists in programming, software engineering, data structure and information retrieval, and to mathematicians whose work involves algorithms, combinatorics, graph theory, operations research, and discrete optimization. The book can also be recommended as a text for graduate courses in computer science, electronics, telecommunications, and control engineering.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Contenuti

Preface. Part 1: Basic Concepts and Algorithms. 1. Trees and Their Properties. 2. Computational Models. Complexity and Fundamental Algorithms. 3. Spanning Trees. Part 2: Translation and Transformation of Programs. 4. Structural Trees. 5. Isomorphism, Unification, and Term-Rewriting Systems. 6. Syntax Trees. Part 3: Search and Storage of Information. 7. Information Trees. 8. Trees for Multilevel Memory. Additional List of Literature. Subject Index.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.