《图论编程：分类树算法》是为程序设计人员所写的计算图论的入门书。主要研究这个快速发展领域的一些关键思想和基本算法，本书描述了关于程序设计和信息论中*重要的一类图——树的某些方法和算法，这些阐述是高水平的且独立于程序设计语言。阅读本书需要熟悉图论和程序设计的基本知识。
本书适合程序设计、软件工程、数据结构、情报检索方面的研究人员和专家及从事算法、组合论、图论、运筹学、离散优化方面研究的数学工作者阅读，也可作为计算机科学、电子学、远程通信技术，控制工程各专业的教材。

Preface
PART1.BASIC CONCEPTS AND ALGORITHMS
Chapter1.TREES AND THEIR PROPERTIES
1.1 Introduction and Basic Defintions
1.2 Representations of Trees
1.3 Bibliographical Notes References
Chapter2.COMPUTATIONAL MODELS.COMPLEXITY AND FUNDAMENTAL ALGORITHMS
2.1 Introduction.Algorithm Representation Language
2.2 Depth-First and Breadth-First Traversals of Graphs and Trees
2.3 Generation of Trees
2.4 Bibligorphical Note References
Chapter3.SPANNING TREES
3.1 The Problem of Finding the Optimal Spanning Tree
3.2 Algonithms of Numbering of All Spanning Tress
3.3 Search of Spanning Trees with Given Poperies
3.4 Bibliographical Notes References
PART2.TRANSLATION AND TRANSFORMATION OF PROGRAMS
Chapter4.STUCTURAL TREES
4.1 Introduction and Principal Definitions
4.2 Hierarchical Representation of Regularizable CF-Graphs
4.3 Hammock Representations of CF-Graphs
4.4 Exposure of the Dominance Relation
4.5 Bibliographical Notes References
Chapter5.ISOMORPHISM,UMIFICATION,AND TERM-REWRITING SYSTEMS
5.1 Isomorphisms of Trees
5.2 Porblem of Unification
5.3 Term-Rewriting Systems
5.4 Bibiographical Notes References
Chapter6.SYNTAX TREES
6.1 Language Syntax and the Problem of Syntax Analysis
6.2 Generative Grammars
6.3 Syntax Analysis
6.4 Translation and Constructors of Analyzers
6.5 Bibliographical Notes References
PART3.SEARCH AND STORAGE OF INFORMATION
Chapter7.INFORMATION TREES
7.1 Balanced Trees
7.2 Multidimensional Trees
7.3 Bibliographical Notes References
Chapter8.TREES FOR MULTILEVEL MEMORY
8.1 B-Trees
8.2 Generalizations of B-Trees
8.3 Multidimensional B-Trees
8.4 Multiattribute Trees
8.5 Bibliographical Notes References
ADDITIONAL LIST OF LITERATURE
SUBJECT INDEX