Graph Theory for Programmers

Algorithms for Processing Trees
2000
ISBN: 978-0-7923-6428-3
Verlag: Springer Netherlands

Buch, Englisch, Band 515, 432 Seiten, HC runder Rücken kaschiert, Format (B × H): 160 mm x 241 mm, Gewicht: 1780 g

Reihe: Mathematics and Its Applications

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.

Zielgruppe

Research

Autoren/Hrsg.

Evstigneev, Vladimir A.

Kasyanov, Victor N.

Fachgebiete

• Mathematik | Informatik EDV | Informatik Betriebssysteme Windows Betriebssysteme
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering Objektorientierte Softwareentwicklung
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik
• Mathematik | Informatik EDV | Informatik Technische Informatik Systemverwaltung & Management
• Mathematik | Informatik Mathematik Operations Research Graphentheorie
• Mathematik | Informatik Mathematik Operations Research Spieltheorie
• Mathematik | Informatik EDV | Informatik Informatik
• Mathematik | Informatik EDV | Informatik Daten / Datenbanken Zeichen- und Zahlendarstellungen
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Computeranwendungen in der Mathematik
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen

Inhaltsverzeichnis

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.