《圖論編程》是2006年科學出版出版的圖書，作者是卡西亞諾夫。
基本介紹
- 書名：圖論編程
- 作者：卡西亞諾夫
- ISBN：9787030166784
- 頁數：432
- 定價：70.00元
- 出版社：科學出版
- 出版時間：2006-1
- 裝幀：精裝
- 開本：16
- 副標題：分類樹算法
- 叢書： 國外數學名著系列
內容簡介,編輯推薦,目錄,
內容簡介
《圖論編程：分類樹算法》是為程式設計人員所寫的計算圖論的入門書。主要研究這個快速發展領域的一些關鍵思想和基本算法，本書描述了關於程式設計和資訊理論中最重要的一類圖——樹的某些方法和算法，這些闡述是高水平的且獨立於程式設計語言。閱讀本書需要熟悉圖論和程式設計的基本知識。
本書適合程式設計、軟體工程、數據結構、情報檢索方面的研究人員和專家及從事算法、組合論、圖論、運籌學、離散最佳化方面研究的數學工作者閱讀，也可作為計算機科學、電子學、遠程通信技術，控制工程各專業的教材。
編輯推薦
適用於運籌與控制專業的圖論、代數圖論等課程。
目錄
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
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
