Car-pooling as a data structuring device: The soft heap

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1461 LNCS, Issue , 1998, Pages 35-42

  Chazelle, Bernard ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; INFORMATION THEORY;

CAR POOLING; DETERMINISTIC ALGORITHMS; MINIMUM SPANNING TREES; PRIORITY QUEUES; STANDARD INFORMATION;

TREES (MATHEMATICS);

EID: 84896777119     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_3     Document Type: Conference Paper

References (6)

1. Chazelle, B. A faster deterministic algorithm for minimum spanning trees, Proc. 38th Ann. IEEE Symp. Found. Comp. Sci. (1997), 22-31.
2. Chazelle, B. A deterministic algorithm for minimum spanning trees, Manuscript, 1998.
3. Fredman, M.L., Tarjan, R.E. Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM 34 (1987), 596-615.
4. Hoffman, K., Mehlhorn, K., Rosenstiehl, P., Tarjan, R.E. Sorting Jordan sequences in linear time using level-linked search trees, Inform. and Control 68 (1986), 170-184.
5. Matias, Y., Vitter, J.S., Young, N. Approximate Data Structures with Applications, Proc. 5th Ann. SIAM/ACM Symp. Disc. Alg. (SODA'94), 1994.
6. Vuillemin, J. A data structure for manipulating priority queues, Commun. ACM 21 (1978), 309-315.