Graph Theory for Programmers: Algorithms for Processing Trees by Victor N. Kasyanov

Graph Theory for Programmers: Algorithms for Processing Trees

byVictor N. Kasyanov, Vladimir A. Evstigneev

Paperback | October 11, 2012

Pricing and Purchase Info


Earn 760 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


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 algo­ rithms 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 mono­ graph on the basis of these books even stronger.
Title:Graph Theory for Programmers: Algorithms for Processing TreesFormat:PaperbackDimensions:432 pages, 24 X 16 X 0 inPublished:October 11, 2012Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:9401058040

ISBN - 13:9789401058049

Appropriate for ages: All ages

Look for similar items by category:

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.