ALGORITHMS FOR BD TREES

被引:11
|
作者
DANDAMUDI, SP
SORENSON, PG
机构
来源
SOFTWARE-PRACTICE & EXPERIENCE | 1986年 / 16卷 / 12期
关键词
D O I
10.1002/spe.4380161203
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:1077 / 1096
页数:20
相关论文
共 50 条
  • [1] PERFORMANCE ANALYSIS OF PARTIAL-MATCH SEARCH ALGORITHMS FOR BD TREES
    DANDAMUDI, SP
    SORENSON, PG
    [J]. SOFTWARE-PRACTICE & EXPERIENCE, 1988, 18 (01): : 83 - 105
  • [2] IMPROVED PARTIAL-MATCH SEARCH ALGORITHMS FOR BD-TREES
    DANDAMUDI, SP
    SORENSON, PG
    [J]. COMPUTER JOURNAL, 1991, 34 (05): : 415 - 422
  • [3] PROBABILISTIC ALGORITHMS FOR TREES
    SAGAN, BE
    YEH, YN
    [J]. FIBONACCI QUARTERLY, 1989, 27 (03): : 201 - 208
  • [4] ON STEINER TREES AND GENETIC ALGORITHMS
    HESSER, J
    MANNER, R
    STUCKY, O
    [J]. LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1991, 565 : 509 - 525
  • [5] Chemical trees enumeration algorithms
    Aringhieri, Roberto
    Hansen, Pierre
    Malucelli, Federico
    [J]. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2003, 1 (01): : 67 - 83
  • [6] Markovian trees: properties and algorithms
    Nigel G. Bean
    Nectarios Kontoleon
    Peter G. Taylor
    [J]. Annals of Operations Research, 2008, 160 : 31 - 50
  • [7] Algorithms for terminal Steiner trees
    Martinez, FV
    de Pina, JC
    Soares, J
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 369 - 379
  • [8] Loopless algorithms and Schroder trees
    Korsh, J
    Lafollette, P
    Lipschutz, S
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2003, 80 (06) : 709 - 725
  • [9] Markovian trees: properties and algorithms
    Bean, Nigel G.
    Kontoleon, Nectarios
    Taylor, Peter G.
    [J]. ANNALS OF OPERATIONS RESEARCH, 2008, 160 (01) : 31 - 50
  • [10] A Note on Trees, Tables, and Algorithms
    Goddard, Wayne
    Hedetniemi, Stephen T.
    [J]. NETWORKS, 2009, 53 (02) : 184 - 190