首页> 外文期刊>Computers & operations research >Corrigendum to 'Enumerating all spanning trees for pairwise comparisons' [Comput. Open Res. 39 (2012) 191-199]
【24h】

Corrigendum to 'Enumerating all spanning trees for pairwise comparisons' [Comput. Open Res. 39 (2012) 191-199]

机译:有关“枚举所有生成树以进行成对比较”的更正[计算。打开资源。 39(2012)191-199]

获取原文
获取原文并翻译 | 示例
           

摘要

The idea of enumerating all spanning trees (EAST) proposed in the above-referenced article is very similar to the combinatorial method proposed by Tsyganok [1 ] (in Ukrainian). Dr. Tsyganok has also cited and explained the method in a recent publication [2]. We believe that our paper differs from [2] in the following ways: 1. EAST is described as a complete form of the additive normal ization method (in Section 3.1).
机译:上面引用的文章中提出的枚举所有生成树(EAST)的想法与Tsyganok [1](乌克兰)提出的组合方法非常相似。 Tsyganok博士在最近的出版物中也引用并解释了该方法[2]。我们认为我们的论文与[2]在以下方面有所不同:1. EAST被描述为加法归一化方法的完整形式(在第3.1节中)。

著录项

  • 来源
    《Computers & operations research》 |2012年第9期|p.2265|共1页
  • 作者单位

    Department of Electrical Engineering, COMSATS Institute of Information Technology, Wan Cantonment, Pakistan,School of Computer Science, The University of Manchester, 2.58 Kilbum Building, M139PL, United Kingdom;

    Manchester Business School, Booth Street West, The University of Manchester, M156PB. United Kingdom;

    School of Computer Science, The University of Manchester, 2.58 Kilbum Building, M139PL, United Kingdom;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号