𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on constructing min-max heaps

✍ Scribed by Thomas Strothotte; Patrik Eriksson; Sören Vallner

Publisher
Springer Netherlands
Year
1989
Tongue
English
Weight
332 KB
Volume
29
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on constructing binary heaps with
A note on constructing binary heaps with periodic networks
✍ Marek Piotrów 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 167 KB

We consider the problem of constructing binary heaps on constant degree networks performing compare-exchange operations only. The heap data structure, introduced by William and Williams [Comm. ACM 7 (6) (1964) 347-348], has many applications and, therefore, has been intensively studied in sequential

Bounds for min-max heaps
Bounds for min-max heaps
✍ A. Hasham; J. -R. Sack 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 589 KB
Note on a min-max conjecture of Woodall
Note on a min-max conjecture of Woodall
✍ Orlando Lee; Yoshiko Wakabayashi 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 78 KB

## Abstract In 1978 Woodall [6] conjectured the following: in a planar digraph the size of a shortest cycle is equal to the maximum cardinality of a collection of disjoint tranversals of cycles. We prove that this conjecture is true when the digraph is series‐parallel. In fact, we prove a stronger