助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[1]页 共[15]条 当前为第1条到15条
 

相关语句
edge graph
Recurrence and transience of the edge graph of a tiling of the euclidean plane
      
The algorithms use characterizations of adjacent vertices in network and dual network LP's to perform an efficient traversal of the edge graph of the polyhedron.
      
Strong isoperimetric inequality for the edge graph of a tiling of the plane
      
We introduce a new kind of graph called "multi-edge graph" which arises in many applications such as finite state Markov chains and broadcasting communication networks.
      
We give two algorithms to partition a multi-edge graph into maximal clusters.
      
As an example, observe that K4 is the edge graph of a tetrahedron.
      
Let R be the set of adjacent vertices to bj on the edge graph of B.
      
Let R be the vertices adjacent to ai on the edge graph of A.
      
Node-Port-Edge graph model that is powerful enough for the vast majorityof connected graph applications.
      
Some nodes or edges can be merged and others can be removed in the output edge graph.
      
The city is stored as a winged-edge graph, with edges in the graph representing streets, and faces representing city blocks.
      
The emphasized edges belong to the last-edge graph determined by the corresponding edge ordering.
      
The problem of finding the minimal edge graph on n nodes that is k-connected is a well studied problem in graph theory.
      
The triples form a directed, labelled-edge graph, with the subjects and objects forming the nodes and the predicates the edges.
      
Underlined edges belong to the last-edge graph determined by the ordering.
      
 

首页上一页1下一页尾页 

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