A NOTE ON CONSTRUCTING MIN-MAX HEAPS

被引：2
|
作者：
STROTHOTTE, T [1 ]
ERIKSSON, P [1 ]
VALLNER, S [1 ]
机构：
[1] UNIV STUTTGART,INST INFORMAT,D-7000 STUTTGART 1,FED REP GER
来源：
BIT | 1989年 / 29卷 / 02期
关键词：
D O I：
10.1007/BF01952680
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：251 / 256
页数：6
相关论文
共 50 条
  • [1] 2 NEW ALGORITHMS FOR CONSTRUCTING MIN-MAX HEAPS
    DRAWS, L
    ERIKSSON, P
    FORSLUND, E
    HOGLUND, L
    VALLNER, S
    STROTHOTTE, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 318 : 43 - 50
  • [2] Reflected min-max heaps
    Makris, C
    Tsakalidis, A
    Tsichlas, K
    INFORMATION PROCESSING LETTERS, 2003, 86 (04) : 209 - 214
  • [3] BOUNDS FOR MIN-MAX HEAPS
    HASHAM, A
    SACK, JR
    BIT, 1987, 27 (03): : 315 - 323
  • [4] MIN-MAX HEAPS AND GENERALIZED PRIORITY-QUEUES
    JONES, DW
    COMMUNICATIONS OF THE ACM, 1987, 30 (03) : 260 - 260
  • [5] MIN-MAX HEAPS AND GENERALIZED PRIORITY-QUEUES
    ATKINSON, MD
    SACK, JR
    SANTORO, N
    STROTHOTTE, T
    COMMUNICATIONS OF THE ACM, 1986, 29 (10) : 996 - 1000
  • [6] A POINTER-FREE DATA STRUCTURE FOR MERGING HEAPS AND MIN-MAX HEAPS
    GAMBOSI, G
    NARDELLI, E
    TALAMO, M
    THEORETICAL COMPUTER SCIENCE, 1991, 84 (01) : 107 - 126
  • [7] A POINTER-FREE DATA STRUCTURE FOR MERGING HEAPS AND MIN-MAX HEAPS
    GAMBOSI, G
    NARDELLI, E
    TALAMO, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 372 : 405 - 438
  • [8] A Note on Min-Max Pair in Tournaments
    Lu, Xiaoyun
    GRAPHS AND COMBINATORICS, 2019, 35 (05) : 1139 - 1145
  • [9] Note on a min-max conjecture of Woodall
    Lee, O
    Wakabayashi, Y
    JOURNAL OF GRAPH THEORY, 2001, 38 (01) : 36 - 41
  • [10] An algorithm for constructing locally optimal min-max triangulation
    Shrivastava, M
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 1996, 54 (01) : 167 - 176
12345