助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   label depth 的翻译结果: 查询用时:0.167秒
图标索引 在分类学科中查询
所有学科
更多类别查询

图标索引 历史查询
 

label depth
相关语句
  标号深度
     Based on the concept of the node label depth,we present a new partitioning shortest path algorithfm that possesses a sharpness property. Our new algorithm has an O(nm)complexity bound, which issuperior to the best bound O(n ̄3)of the previous sharp algorithms for sparse networks. In addition,we also give an O(nm)method for detectinga negative cycle that possesses a time-sharp property.
     文中基于结点标号深度的概念,给出了一个计算复杂性的界为O(nm)并且具有“尖列刀(sharp)性质的求最短路径树的新算法。此外,我们还讨论了负长度环路的探测问题,并给出了一个具有“时间尖刮”(time-sharp)性质的检测负长度环路的方法。
短句来源
  相似匹配句对
     LABEL OF THE SUCCESSFUL
     成功人士的标签
短句来源
     Speed and depth;
     速度和深度;
短句来源
     The influence of depth of
     经反复考察整机,并研究模板压缩孔深度的影响。
短句来源
     Product Label and its Traceability
     产品标识和可追溯性控制
短句来源
查询“label depth”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


In this paper,we consider the problem of finding shortest paths from a given node to all other nodes in a network of n nodes and m arcs orfinding a directed cycle of negative length.Based on the concept of the node label depth,we present a new partitioning shortest path algorithfm that possesses a sharpness property. Our new algorithm has an O(nm)complexity bound, which issuperior to the best bound O(n ̄3)of the previous sharp algorithms for sparse networks.In addition,we also give an O(nm)method for...

In this paper,we consider the problem of finding shortest paths from a given node to all other nodes in a network of n nodes and m arcs orfinding a directed cycle of negative length.Based on the concept of the node label depth,we present a new partitioning shortest path algorithfm that possesses a sharpness property. Our new algorithm has an O(nm)complexity bound, which issuperior to the best bound O(n ̄3)of the previous sharp algorithms for sparse networks.In addition,we also give an O(nm)method for detectinga negative cycle that possesses a time-sharp property.

本义考虑在一个具有n个结点和m条弧的网络中,求出从一个指定的结点到其余所有结点的最短路径,或者找到一条具有负长度环路的问题。文中基于结点标号深度的概念,给出了一个计算复杂性的界为O(nm)并且具有“尖列刀(sharp)性质的求最短路径树的新算法。此外,我们还讨论了负长度环路的探测问题,并给出了一个具有“时间尖刮”(time-sharp)性质的检测负长度环路的方法。

In this paper,based on the "label depth" of a node,we develop a new label correcting algorithm,called the smallest label depth first (SLDF) algorithm,for finding the shortest paths from a given node to all other nodes in a network of n nodes and m arcs,which contains negative length arcs,but no negative length cycles.This new algorithm has the sharpness property by shier and Witzgall ,and a worst case complexity of O(n,m).

基于结点标号深度的概念,给出了求解单源点最短路径问题的一个新算法—SLDF(SmalestLabelDepthFirst)算法.此算法的特点是,它具有Shier&Witzgeal在[1]中提出的所谓“锐利”(Sharp)性质,而且算法的时间复杂性在最坏情况下为O(nm),这里n和m分别表示有向图中结点的数目和弧的数目.因此,该算法的实际效率是相当高的.

 
图标索引 相关查询

 


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

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