Algorithm for geometric minimum spanning trees requiring nearly linear expected time

被引：0
|
作者：
机构：
[1] Clarkson, Kenneth L.
来源：
Clarkson, Kenneth L. | 1600年 / 04期
关键词：
Mathematical Techniques;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [11] A linear-time approximation algorithm for the minimum-length geometric embedding of trees
    Bagheri, Alireza
    Keshavarz-Kohjerdi, Fatemeh
    Razzazi, Mohammadreza
    OPTIMIZATION, 2024,
  • [12] Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures
    Enrico Nardelli
    Guido Proietti
    Peter Widmayer
    Algorithmica , 2004, 40 : 119 - 132
  • [13] Nearly linear time minimum spanning tree maintenance for transient node failures
    Nardelli, E
    Proietti, G
    Widmayer, P
    ALGORITHMICA, 2004, 40 (02) : 119 - 132
  • [14] VERIFICATION AND SENSITIVITY ANALYSIS OF MINIMUM SPANNING-TREES IN LINEAR TIME
    DIXON, B
    RAUCH, M
    TARJAN, RE
    SIAM JOURNAL ON COMPUTING, 1992, 21 (06) : 1184 - 1192
  • [15] Computing Minimum Dilation Spanning Trees in Geometric Graphs
    Brandt, Alex F.
    Gaiowski, Miguel F. A. de M.
    de Rezende, Pedro J.
    de Souza, Cid C.
    COMPUTING AND COMBINATORICS, 2015, 9198 : 297 - 309
  • [16] A sublinear time distributed algorithm for minimum-weight spanning trees
    Garay, JA
    Kutten, S
    Peleg, D
    SIAM JOURNAL ON COMPUTING, 1998, 27 (01) : 302 - 316
  • [17] A LINEAR-TIME ALGORITHM FOR FINDING A MINIMUM SPANNING PSEUDOFOREST
    GABOW, HN
    TARJAN, RE
    INFORMATION PROCESSING LETTERS, 1988, 27 (05) : 259 - 263
  • [18] The Complexity and Algorithm for Minimum Expense Spanning Trees
    Zhan Ning
    Wu Longshu
    2012 INTERNATIONAL WORKSHOP ON INFORMATION AND ELECTRONICS ENGINEERING, 2012, 29 : 118 - 122
  • [19] A faster deterministic algorithm for minimum spanning trees
    Chazelle, B
    38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 22 - 34
  • [20] A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees
    Pandurangan, Gopal
    Robinson, Peter
    Scquizzato, Michele
    STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 743 - 756
12345