圖書信息
出版社: 科學出版社; 第1版 (2006年12月8日)
叢書名: 國外數學名著系列（影印版）
精裝: 448頁
開本: 16
ISBN: 7030166787
條形碼: 9787030166784
尺寸: 24 x 17.6 x 2.6 cm
重量: 821 g
作者簡介
作者：(俄)卡西亞諾夫
內容簡介
《圖論編程分類樹算法》適合程式設計，軟體工程，數據結構，情報檢索方面的研究人員和專家及從事算法，組合論，運籌學，離散最佳化方面研究的數學工作者閱讀，也可作為計算機科學，電子學，遠程通信技術，控制工程各專業的教材。
目錄
Preface
PART1,BASIC CONCEPTS AND ALGORITHMS
Chapter1,TREES AND THEIR PROPERTIES
1.1 Intronduction and Basic Definitions
1.2 Representations of Trees
1.3 Numbering and Calculation of Trees
1.4 Bibliongraphical
Notes Refences
Chapter 2. 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 Bibliographical Notes
References
Chapter 3.SPANNING TREES
3.1 The Problem of Finding the Optimal Spanning Tree
3.2 Algorithms of Numbering of All Spanning Trees
3.3 Search of Spanning Trees with Given Properties
3.4 Bibliographical Notes
References
PART 2.TRANSLATION AND TRANSFORMATION OF PROGRAMS
Chapter 4.STRUCTURAL TREES
4.1 Intronduction and Principal Definitions
4.2 Hierarchical Represntations of Regularizable CF-Graphs
4.3 Hammock Representations of CF-Graphs
4.4 Exposure of the Dominance Relation
4.5 Bibliographical Notes
References
Chapter 5.ISOMORPHISM,unification,AND TERM.REWRITNG SYSTEMS
5.1 Isomorphisms of Trees
5.2 Problem of Unification
5.3 Term-Rewriting Systems
5.4 Bibliographical Notes
References
……
