Optimal node ranking of trees in linear time

被引：0
|
作者：
机构：
[1] Schaffer, Alejandro A.
来源：
Schaffer, Alejandro A. | 1600年 / 33期
关键词：
Mathematical Techniques;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] OPTIMAL NODE RANKING OF TREES IN LINEAR TIME
    SCHAFFER, AA
    INFORMATION PROCESSING LETTERS, 1989, 33 (02) : 91 - 96
  • [2] Optimal Edge Ranking of Trees in Linear Time
    T. W. Lam
    F. L. Yue
    Algorithmica, 2001, 30 : 12 - 33
  • [3] Optimal edge ranking of trees in linear time
    Lam, TW
    Yue, FL
    ALGORITHMICA, 2001, 30 (01) : 12 - 33
  • [4] OPTIMAL NODE RANKING OF TREES
    IYER, AV
    RATLIFF, HD
    VIJAYAN, G
    INFORMATION PROCESSING LETTERS, 1988, 28 (05) : 225 - 229
  • [5] OPTIMAL EDGE RANKING OF TREES IN POLYNOMIAL-TIME
    DELATORRE, P
    GREENLAW, R
    SCHAFFER, AA
    ALGORITHMICA, 1995, 13 (06) : 592 - 618
  • [6] Computing optimal linear layouts of trees in linear time
    Skodinis, Konstantin
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2000, 1879 : 403 - 414
  • [7] Optimal integer alphabetic trees in linear time
    Hu, TC
    Larmore, LL
    Morgenthaler, JD
    ALGORITHMS - ESA 2005, 2005, 3669 : 226 - 237
  • [8] Linear-time construction of optimal context trees
    Helfgott, H
    Cohn, M
    DCC '98 - DATA COMPRESSION CONFERENCE, 1998, : 369 - 377
  • [9] An On-Line Parallel Algorithm for Node Ranking of Trees
    Lee, Chia-Wei
    Juan, Justie Su-Tzu
    Wu, Tai-Lung
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PROCEEDINGS, 2009, 5574 : 384 - +
  • [10] Influential node ranking via randomized spanning trees
    Dai, Zhen
    Li, Ping
    Chen, Yan
    Zhang, Kai
    Zhang, Jie
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2019, 526
12345