✦ LIBER ✦

An optimal algorithm for deleting the root of a heap

✍ Scribed by Svante Carlsson

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 491 KB
Volume: 37
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90144-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal algorithm for the period of a

An optimal algorithm for the period of a strongly connected digraph

✍ Adriano Pascoletti 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 393 KB

An algorithm for the determination of th

An algorithm for the determination of the optimal frequency of periodic processes

✍ A. Locatelli; S. Rinaldi 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 574 KB

Optimal periodic processes with given initial conditions are here considered from a computational point of view. A search plan for the frequency of the periodic process is derived according to a min-max criterion. SnmmRry--The paper deals with the problem of optimization of periodic processes with

An algorithm for the optimization of dir

An algorithm for the optimization of directionally stretched triangulations

✍ Hou Zhang; Jean-Yves Trépanier 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 716 KB

An Optimal Algorithm for the Intersectio

An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons

✍ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the

An algorithm for generating the positive

An algorithm for generating the positive roots of simple lie algebras

✍ A.K. Bose 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 165 KB

We present a combinatorial algorithm for computing the positive roots of all nine types of simple Lie algebras over complexes. It was implemented on a programmable desk calculator. Simple Lie algebras play a key role in many bran-6

An Optimal Algorithm for the Straight Se

An Optimal Algorithm for the Straight Segment Approximation of Digital Arcs

✍ Y.M. Sharaiha; N. Christofides 📂 Article 📅 1993 🏛 Elsevier Science ⚖ 842 KB

In this paper, we define the straight segment approximation problem (SSAP) for a given digital arc as that of locating a minimum subset of vertices on the arc such that they form a connected sequence of digital straight segments. Sharaiha (Ph.D. thesis, Imperial College, London, 1991) introduced the