Dynamic Partial Orders and Generalized Heaps
作者： Hartmut Noltemeier
DOI: 10.1007/978-3-7091-9076-0_7
关键词:
摘要: Dynamic Partial Orders and Generalized Heaps. Classical recent results are surveyed in the development of efficient representations dynamic partial orders by heaps their generalizations.
springer.com
sci-hub.se 参考文章(23)
Hartmut Noltemeier, Graphentheorie : mit Algorithmen und Anwendungen De Gruyter. ,(1975) , 10.1515/9783110838442
Robert Endre Tarjan, Data Structures and Network Algorithms ,(1983)
Kurt Mehlhorn, Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen Teubner. ,(1988)
Svante Carlsson, J. Ian Munro, Patricio V. Poblete, An implicit binomial queue with constant insertion time scandinavian workshop on algorithm theory. pp. 1- 13 ,(1988) , 10.1007/3-540-19487-8_1
H. J. Olivié, A new class of balanced search trees : half-balanced binary search tress Theoretical Informatics and Applications. ,vol. 16, pp. 51- 71 ,(1982) , 10.1051/ITA/1982160100511
M. H. Overmars, J. van Leeuwen, Two general methods for dynamizing decomposable searching problems Computing. ,vol. 26, pp. 155- 166 ,(1981) , 10.1007/BF02241781
Hartmut Noltemeier, On a Generalization of Heaps workshop on graph theoretic concepts in computer science. pp. 127- 136 ,(1980) , 10.1007/3-540-10291-4_10
Jean Vuillemin, A data structure for manipulating priority queues Communications of the ACM. ,vol. 21, pp. 309- 315 ,(1978) , 10.1145/359460.359478
G. Schulz, Noltemeier, H., Graphentheorie mit Algorithmen und Anwendungen. Berlin-New York. Walter de Gruyter. 1976. 239 S., DM 48,- . ZAMM - Zeitschrift für Angewandte Mathematik und Mechanik. ,vol. 57, pp. 421- 421 ,(1977) , 10.1002/ZAMM.19770570715
Robert Endre Tarjan, Amortized Computational Complexity Siam Journal on Algebraic and Discrete Methods. ,vol. 6, pp. 306- 318 ,(1985) , 10.1137/0606031