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 条
  • [1] On the minimum label spanning tree problem
    Krumke, SO
    Wirth, HC
    [J]. INFORMATION PROCESSING LETTERS, 1998, 66 (02) : 81 - 85
  • [2] A constrained minimum spanning tree problem
    Chen, GT
    Zhang, GC
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (09) : 867 - 875
  • [3] ON THE GENERALIZED MINIMUM SPANNING TREE PROBLEM
    MYUNG, YS
    LEE, CH
    TCHA, DW
    [J]. NETWORKS, 1995, 26 (04) : 231 - 241
  • [4] The minimum risk spanning tree problem
    Chen, Xujin
    Hu, Jie
    Hu, Xiaodong
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2007, 4616 : 81 - +
  • [5] The Minimum Moving Spanning Tree Problem
    Akitaya, Hugo A.
    Biniaz, Ahmad
    Bose, Prosenjit
    De Carufel, Jean-Lou
    Maheshwari, Anil
    da Silveira, Luís Fernando Schultz Xavier
    Smid, Michiel
    [J]. Journal of Graph Algorithms and Applications, 2023, 27 (01) : 1 - 18
  • [6] The Distributed Minimum Spanning Tree Problem
    Schmid, Stefan
    Pandurangan, Gopal
    Robinson, Peter
    Scquizzato, Michele
    [J]. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2018, (125): : 51 - 80
  • [7] ON THE MINIMUM DIAMETER SPANNING TREE PROBLEM
    HASSIN, R
    TAMIR, A
    [J]. INFORMATION PROCESSING LETTERS, 1995, 53 (02) : 109 - 111
  • [8] The minimum spanning tree problem in archaeology
    Hage, P
    Harary, F
    James, B
    [J]. AMERICAN ANTIQUITY, 1996, 61 (01) : 149 - 155
  • [9] THE PROBABILISTIC MINIMUM SPANNING TREE PROBLEM
    BERTSIMAS, DJ
    [J]. NETWORKS, 1990, 20 (03) : 245 - 275
  • [10] THE QUADRATIC MINIMUM SPANNING TREE PROBLEM
    ASSAD, A
    XU, WX
    [J]. NAVAL RESEARCH LOGISTICS, 1992, 39 (03) : 399 - 417
12345