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

by Victor N. Kasyanov, Vladimir A. Evstigneev

Overview

In delivering lectures and writing books, we were most often forced to pay absolutely no attention to a great body of interesting results and useful algorithms appearing in numerous sources and occasionally encountered. It was absolutely that most of these re­ sults would finally be forgotten because it is impossible to run through the entire variety of sources where these materials could be published. Therefore, we decided to do what we can to correct this situation. We discussed this problem with Ershov and came to an idea to write an encyclopedia of algorithms on graphs focusing our main attention on the algorithms already used in programming and their generalizations or modifications. We thought that it is reasonable to group all graphs into certain classes and place the algorithms developed for each class into a separate book. The existence of trees, i. e. , a class of graphs especially important for programming, also supported this decision. This monograph is the first but, as we hope, not the last book written as part of our project. It was preceded by two books "Algorithms on Trees" (1984) and "Algorithms of Processing of Trees" (1990) small editions of which were published at the Computer Center of the Siberian Division of the Russian Academy of Sciences. The books were distributed immediately and this made out our decision to prepare a combined monograph on the basis of these books even stronger.

Product Details

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

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.

Editorial Reviews

Treats algorithmic graph theory specifically for programmers. Explores some key ideas and basic algorithms in the 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. Assumes familiarity with basics of graph theory and programming. Of interest to researchers and specialists in programing, software engineering, and mathematics. Can be used as a text for graduate courses in computer science, electronics, control engineering, and telecommunications. Evstigneev is affiliated with the Institute of Informatics Systems, Russian Academy of Sciences. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Booknews