信息超圖理論

定　價：￥48.00

作　者：	Jianfang Wang
出版社：	科學出版社
叢編項：
標　簽：	計算機理論

購買這本書可以去

ISBN：	9787030206510	出版時間：	2008-01-01	包裝：	平裝
開本：	16	頁數(shù)：	162	字數(shù)：

內(nèi)容簡介

　　In the past years，all concepts in graphs were translated to hypergraphs，in special，the definition of cycles in hypergraphs is the same as in graphs.As extension of graphs，there are many results on trees，cycles，covering and coloring of hypergraphs.本書為信息超圖理論英文版，適合本科以上文化程度人群閱讀。

作者簡介

暫缺《信息超圖理論》作者簡介

圖書目錄

Chapter 1 Basic Terminologies
Chapter 2 Relational Databases
2.1 Operators and operands in relational algebra
2.2 Dependences in relations
2.3 Entropy
2.4 Conflict—free sets of MVDs
2.5 Consistency of databases
2.6 Monotone join expression
Chapter 3 Some Classical Results
Chapter 4 Acyclic Hypergraphs
4.1 Characteristics of acyclic hypergraphs
4.2 Size of acyclic hypergraphs
4.3 Enumeration of acyclic hypergraphs
Chapter 5 Algorithms to Test Acyclicity of Hypergraphs
Chapter 6 Characteristics of Cyclic Hypergraphs
Chapter 7 Three Parameters
Chapter 8 Cycles of Hypergraphs
8.1 Cycle—axiom of hypergraphs
8.2 Cyclomatic numbers of hypergraphs
8.3 Extreme value of cyclomatic numbers of hypergraphs
8.4 On size ofunicycle hypergraphs
8.5 M5bius functions
Chapter 9 Hamiltonian Cycles of Hypergraphs
Chapter 10 Decompositions of Hypergraphs
10.1 Acyclic decompositions of hypergraphs
10.2 A structure decompositions for hypergraphs
Bibliography
Appendix