Correction to: Counting Minimum Weight Arborescences

被引：0
|
作者：
Koyo Hayashi
Satoru Iwata
机构：
[1] University of Tokyo,Department of Mathematical Informatics
来源：
Algorithmica | 2019年 / 81卷 / 1期
关键词：
D O I：
10.1007/s00453-018-0509-3
中图分类号：
学科分类号：
摘要：
The HTML version of this article as originally published contains an error: What is presented as Equation 4 is actually the equation that is correctly presented later in the article as Equation 6.
引用
收藏
页码：418 / 418
相关论文
共 50 条
  • [1] Counting Minimum Weight Arborescences
    Koyo Hayashi
    Satoru Iwata
    [J]. Algorithmica, 2018, 80 : 3908 - 3919
  • [2] Counting Minimum Weight Arborescences
    Hayashi, Koyo
    Iwata, Satoru
    [J]. ALGORITHMICA, 2018, 80 (12) : 3908 - 3919
  • [3] Counting Minimum Weight Arborescences (vol 80, pg 3908, 2018)
    Hayashi, Koyo
    Iwata, Satoru
    [J]. ALGORITHMICA, 2019, 81 (01) : 418 - 418
  • [4] Minimum cost arborescences
    Dutta, Bhaskar
    Mishra, Debasis
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2012, 74 (01) : 120 - 143
  • [5] On Minimum Changeover Cost Arborescences
    Galbiati, Giulia
    Gualandi, Stefano
    Maffioli, Francesco
    [J]. EXPERIMENTAL ALGORITHMS, 2011, 6630 : 112 - +
  • [6] Robustness of minimum cost arborescences
    Kamiyama, Naoyuki
    [J]. JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 2012, 29 (03) : 485 - 497
  • [7] Robustness of minimum cost arborescences
    Naoyuki Kamiyama
    [J]. Japan Journal of Industrial and Applied Mathematics, 2012, 29 : 485 - 497
  • [8] Heuristic and exact algorithms for minimum-weight non-spanning arborescences
    Ritt, Marcus
    Pereira, Jordi
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 287 (01) : 61 - 75
  • [9] Counting minimum weight spanning trees
    Broder, AZ
    Mayr, EW
    [J]. JOURNAL OF ALGORITHMS, 1997, 24 (01) : 171 - 176
  • [10] Robustness of Minimum Cost Arborescences
    Kamiyama, Naoyuki
    [J]. ALGORITHMS AND COMPUTATION, 2011, 7074 : 130 - 139
12345