Graph theory for programmers : algorithms for processing trees

Author(s)
    • Kasyanov, Victor N.
    • Evstigneev, Vladimir A.
Bibliographic Information

Graph theory for programmers : algorithms for processing trees

by Victor N. Kasyanov and Vladimir A. Evstigneev ; [translated by P. Malyshev]

(Mathematics and its applications, v. 515)

Kluwer Academic Publishers, c2000

Other Title

Graph theory : algorithms for processing trees

Search this Book/Journal
Note

Bibliographical references: p. 423-425

Include index

"This is a completely revised and updated translation of Graph theory : algorithms for processing trees" -- on t.p. verso

Description and Table of Contents

Description

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.

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.

by "Nielsen BookData"

Related Books: 1-1 of 1
Details
  • NCID
    BA48920588
  • ISBN
    • 0792364287
  • LCCN
    00041094
  • Country Code
    ne
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Original Language Code
    rus
  • Place of Publication
    Dordrecht ; Boston
  • Pages/Volumes
    x, 432 p.
  • Size
    25 cm
  • Classification
  • Subject Headings
  • Parent Bibliography ID
Page Top