ON THE HISTORY OF THE MINIMUM SPANNING TREE PROBLEM

被引：1
|
作者：
GRAHAM, RL [1 ]
HELL, P [1 ]
机构：
[1] SIMON FRASER UNIV,DEPT COMP SCI,BURNABY V5A 1S6,BC,CANADA
来源：
ANNALS OF THE HISTORY OF COMPUTING | 1985年 / 7卷 / 01期
关键词：
D O I：
暂无
中图分类号：
N09 [自然科学史]; B [哲学、宗教];
学科分类号：
01 ; 0101 ; 010108 ; 060207 ; 060305 ; 0712 ;
摘要：
引用
收藏
页码：43 / 57
页数：15
相关论文
共 50 条
  • [21] The Budgeted Labeled Minimum Spanning Tree Problem
    Cerulli, Raffaele
    D'Ambrosio, Ciriaco
    Serra, Domenico
    Sorgente, Carmine
    [J]. MATHEMATICS, 2024, 12 (02)
  • [22] Minimum Spanning Tree Problem with Label Selection
    Fujiyoshi, Akio
    Suzuki, Masakazu
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2011, E94D (02) : 233 - 239
  • [23] The minimum spanning tree problem with fuzzy costs
    Adam Janiak
    Adam Kasperski
    [J]. Fuzzy Optimization and Decision Making, 2008, 7 : 105 - 118
  • [24] Uncertain quadratic minimum spanning tree problem
    [J]. Wang, K. (ke@shu.edu.cn), 1600, Engineering and Technology Publishing (09)
  • [25] Minimum Spanning Tree Cycle Intersection problem
    Dubinsky, Manuel
    Massri, Cesar
    Taubin, Gabriel
    [J]. DISCRETE APPLIED MATHEMATICS, 2021, 294 : 152 - 166
  • [26] The minimum-area spanning tree problem
    Carmi, P
    Katz, MJ
    Mitchell, JSB
    [J]. ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2005, 3608 : 195 - 204
  • [27] The Minimum-Area Spanning Tree problem
    Carmi, Paz
    Katz, Matthew J.
    Mitchell, Joseph S. B.
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2006, 35 (03): : 218 - 225
  • [28] RAMP for the capacitated minimum spanning tree problem
    Cesar Rego
    Frank Mathew
    Fred Glover
    [J]. Annals of Operations Research, 2010, 181 : 661 - 681
  • [29] On the complexity of the bilevel minimum spanning tree problem
    Buchheim, Christoph
    Henke, Dorothee
    Hommelsheim, Felix
    [J]. NETWORKS, 2022, 80 (03) : 338 - 355
  • [30] Stochastic quadratic minimum spanning tree problem
    Lu, Mei
    Gao, Jinwu
    [J]. Proceedings of the First International Conference on Information and Management Sciences, 2002, 1 : 179 - 183
12345