Farthest neighbors, maximum spanning trees and related problems in higher dimensions

被引：44
|
作者：
Agarwal, P.K.
Matousek, J.
Suri, S.
机构：
来源：
Computational Geometry: Theory and Applications | 1992年 / 1卷 / 04期
关键词：
D O I：
10.1016/0925-7721(92)90001-9
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [11] Spanning trees and optimization problems
    Akkucuk, Ulas
    INTERFACES, 2006, 36 (03) : 277 - 278
  • [12] On minimal cost-reliability ratio spanning trees and related problems
    Chang, YC
    Hsu, LH
    OPERATIONS RESEARCH LETTERS, 1996, 19 (02) : 65 - 69
  • [13] Minimal cost-reliability ratio spanning trees and related problems
    Natl Chiao Tung Univ, Hsinchu, Taiwan
    Oper Res Lett, 2 (65-69):
  • [14] BOUNDED-DIAMETER MINIMUM SPANNING-TREES AND RELATED PROBLEMS
    HO, JM
    LEE, DT
    CHANG, CH
    PROCEEDINGS OF THE FIFTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY, 1989, : 276 - 282
  • [15] The diameter of uniform spanning trees in high dimensions
    Michaeli, Peleg
    Nachmias, Asaf
    Shalev, Matan
    PROBABILITY THEORY AND RELATED FIELDS, 2021, 179 (1-2) : 261 - 294
  • [16] Spanning trees on graphs and lattices in d dimensions
    Shrock, R
    Wu, FY
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2000, 33 (21): : 3881 - 3902
  • [17] The diameter of uniform spanning trees in high dimensions
    Peleg Michaeli
    Asaf Nachmias
    Matan Shalev
    Probability Theory and Related Fields, 2021, 179 : 261 - 294
  • [18] The distribution of node degree in maximum spanning trees
    Willemain, TR
    Bennett, MV
    JOURNAL OF STATISTICAL COMPUTATION AND SIMULATION, 2002, 72 (02) : 101 - 106
  • [19] On spanning trees and walks of low maximum degree
    Sanders, DP
    Zhao, Y
    JOURNAL OF GRAPH THEORY, 2001, 36 (02) : 67 - 74
  • [20] On the characterization of graphs with maximum number of spanning trees
    Petingi, L
    Boesch, F
    Suffel, C
    DISCRETE MATHEMATICS, 1998, 179 (1-3) : 155 - 166
12345