Graph Theory for Programmers: Algorithms for Processing Trees
Author:   Victor N. Kasyanov ,  Vladimir A. Evstigneev
Publisher:   Springer
Edition:   2000 ed.
Volume:   515
ISBN:  

9780792364283


Pages:   432
Publication Date:   31 August 2000
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $789.36 Quantity:  
Add to Cart

Share |

Graph Theory for Programmers: Algorithms for Processing Trees


Add your own review!

Overview

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.

Full Product Details

Author:   Victor N. Kasyanov ,  Vladimir A. Evstigneev
Publisher:   Springer
Imprint:   Springer
Edition:   2000 ed.
Volume:   515
Dimensions:   Width: 17.00cm , Height: 2.50cm , Length: 24.40cm
Weight:   1.780kg
ISBN:  

9780792364283


ISBN 10:   0792364287
Pages:   432
Publication Date:   31 August 2000
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

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

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now