Graph Theory for Programmers: Algorithms for Processing Trees / Edition 1

Graph Theory for Programmers: Algorithms for Processing Trees / Edition 1

by Victor N. Kasyanov, Vladimir A. Evstigneev, Vladmir A. Evstigneev
     
 

ISBN-10: 0792364287

ISBN-13: 9780792364283

Pub. Date: 08/31/2000

Publisher: Springer Netherlands

This introductory book treats algorithmic graph theory specifically for programmers. It explores some key ideas and basic algorithms in this large and rapidly 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

Overview

This introductory book treats algorithmic graph theory specifically for programmers. It explores some key ideas and basic algorithms in this large and rapidly 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.
Audience: This volume will 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.

Product Details

ISBN-13:
9780792364283
Publisher:
Springer Netherlands
Publication date:
08/31/2000
Series:
Mathematics and Its Applications (closed) Series, #515
Edition description:
2000
Pages:
448
Product dimensions:
6.69(w) x 9.61(h) x 0.36(d)

Table of Contents

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.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >