Optimal node ranking of trees in linear time

被引：0
|
作者：
机构：
[1] Schaffer, Alejandro A.
来源：
Schaffer, Alejandro A. | 1600年 / 33期
关键词：
Mathematical Techniques;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] Minimax trees in linear time with applications
    Gawrychowski, Pawel
    Gagie, Travis
    EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (01) : 82 - 90
  • [32] Linear time algorithms on mirror trees
    Quilliot, Alain
    Rebaine, Djamal
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (05) : 3495 - 3519
  • [33] Drawing rooted trees in linear time
    Buchheim, C
    Jünger, M
    Leipert, S
    SOFTWARE-PRACTICE & EXPERIENCE, 2006, 36 (06): : 651 - 665
  • [34] Optimal Steiner trees under node and edge privacy conflicts
    Alessandro Hill
    Roberto Baldacci
    Stefan Voß
    Journal of Combinatorial Optimization, 2022, 43 : 1509 - 1533
  • [35] Optimal Steiner trees under node and edge privacy conflicts
    Hill, Alessandro
    Baldacci, Roberto
    Voss, Stefan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 43 (05) : 1509 - 1533
  • [36] A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees
    Rajasingh, Indra
    Rajan, R. Sundara
    Manuel, Paul
    PARALLEL PROCESSING LETTERS, 2015, 25 (04)
  • [37] New linear node splitting algorithm for R-trees
    Ang, CH
    Tan, TC
    ADVANCES IN SPATIAL DATABASES, 1997, 1262 : 339 - 349
  • [38] Bagging Ranking Trees
    Clemencon, Stephan
    Depecker, Marine
    Vayatis, Nicolas
    EIGHTH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS, PROCEEDINGS, 2009, : 658 - +
  • [39] Efficient linear-time ranking and unranking of derangements
    Mikawa, Kenji
    Tanaka, Ken
    INFORMATION PROCESSING LETTERS, 2023, 179
  • [40] A LINEAR TIME ALGORITHM FOR FULL STEINER TREES
    HWANG, FK
    OPERATIONS RESEARCH LETTERS, 1986, 4 (05) : 235 - 237
12345