助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   mixed hypergraph 的翻译结果: 查询用时:0.007秒
图标索引 在分类学科中查询
所有学科
数学
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

mixed hypergraph
相关语句
  混合超图
     AN ALGORITHM TO DECIDE THE 4NF BASED ON A MIXED HYPERGRAPH
     基于混合超图的一种4NF的判定算法
短句来源
     In this paper,the theory about 4NF decision in a mixed hypergraph is discussed, and then an algorithm to decide if the relational schema belongs to 4NF is given.
     本文讨论了混合超图中与4NF判定有关的理论,并在此基础上给出了一个对应的关系模式是否属于4NF的判定算法。
短句来源
     RESEARCH ON ALGORITHMS TO FIND OUT MINIMUM COVER AND CLOSURE BASED ON MIXED HYPERGRAPH
     基于混合超图的最小覆盖、闭包求解算法研究
短句来源
     A mixed hypergraph consists of a finite set and two families of subsets: D-edges and C-edges.
     混合超图是含有两种超边的超图,一种称为D-超边,一种称为C-超边,它们的区别主要体现在染色要求上.
短句来源
     In this paper,some theorems relevant to eliminating redundancy based on a mixed hypergraph are discussed and the theory is improved.
     文中讨论了基于混合超图的有关冗余消除的部分定理,完善了这一理论。
短句来源
更多       
  c-超图
     A mixed hypergraph is called a C-hypergraphs if it contains C-edges only.
     只含D-超边的超图称为D-超图,只含C-超边的超图称为C-超图.
短句来源
  “mixed hypergraph”译为未确定词的双语例句
     In this paper,the class definition and the theory about quasi-paths in a forward mixed hypergraph and an inverse mixed hypergraph are separately discussed in detail.
     本文分别详细讨论了正向混合起图和逆向混合超图中准路的分类定义及理论。
短句来源
     The theory in relation to implication in the forward mixed hypergraph is given, and some theorems in relation to eliminating redundancy in inverse mixed hypergraph are given partially.
     给出了正向混合起图中与蕴涵有关的理论,同时,还部分地给出了逆向混合超图中的与消除冗余有关的几个定理。
短句来源
查询“mixed hypergraph”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  mixed hypergraph
[Graphs and Combinatorics 18 (2002), 309-318] that a set S of natural numbers is the feasible set of some mixed hypergraph if and only if either $$1 \notin S$$ or S is an 'interval' $$\{1, \ldots, k \}$$ for some integer k ≥ 1.
      
A mixed hypergraph is a triple ?=(X, ?, ?), where X is the vertex set, and each of ?, ? is a list of subsets of X.
      


In this paper,the class definition and the theory about quasi-paths in a forward mixed hypergraph and an inverse mixed hypergraph are separately discussed in detail. The theory in relation to implication in the forward mixed hypergraph is given, and some theorems in relation to eliminating redundancy in inverse mixed hypergraph are given partially.

本文分别详细讨论了正向混合起图和逆向混合超图中准路的分类定义及理论。给出了正向混合起图中与蕴涵有关的理论,同时,还部分地给出了逆向混合超图中的与消除冗余有关的几个定理。

In this paper,some theorems relevant to eliminating redundancy based on a mixed hypergraph are discussed and the theory is improved.New algorithms to find out minimum cover and closure are given and the relevant algorithms are analyzed.

文中讨论了基于混合超图的有关冗余消除的部分定理,完善了这一理论。并给出了最小覆盖、闭包求解的新算法,进行了相关算法分析。

In this paper,the theory about 4NF decision in a mixed hypergraph is discussed, and then an algorithm to decide if the relational schema belongs to 4NF is given.

本文讨论了混合超图中与4NF判定有关的理论,并在此基础上给出了一个对应的关系模式是否属于4NF的判定算法。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关mixed hypergraph的内容
在知识搜索中查有关mixed hypergraph的内容
在数字搜索中查有关mixed hypergraph的内容
在概念知识元中查有关mixed hypergraph的内容
在学术趋势中查有关mixed hypergraph的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社