✦ LIBER ✦

Bounds for min-max heaps

✍ Scribed by A. Hasham; J. -R. Sack

Publisher: Springer Netherlands
Year: 1987
Tongue: English
Weight: 589 KB
Volume: 27
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01933726

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reflected min-max heaps

✍ Christos Makris; Athanasios Tsakalidis; Kostas Tsichlas 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 98 KB

In this paper we present a simple and efficient implementation of a min-max priority queue, reflected min-max priority queues. The main merits of our construction are threefold. First, the space utilization of the reflected min-max heaps is much better than the naive solution of putting two heaps ba

The bounds of min-max pair heap construc

The bounds of min-max pair heap construction

✍ R.A. Chowdhury; M.Z. Rahman; M. Kaykobad 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 372 KB

The relaxed min-max heap

✍ Yuzheng Ding; Mark Allen Weiss 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 981 KB

A note on constructing min-max heaps

✍ Thomas Strothotte; Patrik Eriksson; Sören Vallner 📂 Article 📅 1989 🏛 Springer Netherlands 🌐 English ⚖ 332 KB

Min/max bounds for dynamic network flows

✍ W. L. Wilkinson 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 582 KB

Improved bounds on the max-flow min-cut

Improved bounds on the max-flow min-cut ratio for multicommodity flows

✍ Serge Plotkin; Éva Tardos 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 671 KB