Optimal node ranking of trees in linear time

被引:0
|
作者
机构
[1] Schaffer, Alejandro A.
来源
Schaffer, Alejandro A. | 1600年 / 33期
关键词
Mathematical Techniques;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [21] Constructing optimal search trees in optimal time
    Zheng, SQ
    Sun, M
    IEEE TRANSACTIONS ON COMPUTERS, 1999, 48 (07) : 738 - 743
  • [22] Distinguishing trees in linear time
    Lozano, Antoni
    Mora, Merce
    Seara, Carlos
    ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (02):
  • [23] Distributed Voting/Ranking With Optimal Number of States per Node
    Salehkaleybar, Saber
    Sharif-Nassab, Arsalan
    Golestani, S. Jamaloddin
    IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, 2015, 1 (04): : 259 - 267
  • [24] A linear-time optimal-message distributed algorithm for minimum spanning trees
    Michalis Faloutsos
    Mart Molle
    Distributed Computing, 2004, 17 : 151 - 170
  • [25] A linear-time optimal-message distributed algorithm for minimum spanning trees
    Faloutsos, M
    Molle, M
    DISTRIBUTED COMPUTING, 2004, 17 (02) : 151 - 170
  • [26] Classification trees with bivariate linear discriminant node models
    Kim, H
    Loh, WY
    JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2003, 12 (03) : 512 - 530
  • [27] OPTIMAL-TIME ALGORITHM FOR THE k-NODE-CONNECTIVITY AUGMENTATION PROBLEM FOR TERNARY TREES.
    Masuzawa, Toshimitsu
    Hagihara, Ken'ichi
    Tokura, Nobuki
    Wada, Koichi
    1600, (17):
  • [28] Bottleneck multicast trees in linear time
    Georgiadis, L
    IEEE COMMUNICATIONS LETTERS, 2003, 7 (11) : 564 - 566
  • [29] Linear time algorithms on mirror trees
    Alain Quilliot
    Djamal Rebaine
    Journal of Combinatorial Optimization, 2022, 44 : 3495 - 3519
  • [30] Minimax Trees in Linear Time with Applications
    Gawrychowski, Pawel
    Gagie, Travis
    COMBINATORIAL ALGORITHMS, 2009, 5874 : 278 - +