✦ LIBER ✦

A selection algorithm with a practical upper bound on expected number of comparisons

✍ Scribed by Jong Soo Park; Myunghwan Kim

Book ID: 112210528
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 393 KB
Volume: 19
Category: Article
ISSN: 0038-0644
DOI: 10.1002/spe.4380191107

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A sharp upper bound for the expected num

A sharp upper bound for the expected number of false rejections

✍ Alexander Y. Gordon 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 225 KB

An upper bound for the expected number o

An upper bound for the expected number of real zeros of a random polynomial

✍ J.Ernest Wilkins Jr. 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 312 KB

A New Upper Bound on the Cheeger Number

A New Upper Bound on the Cheeger Number of a Graph

✍ Sorin Dragomir; Elisabetta Barletta 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Using a technique developed by A. Nilli (1991, Discrete Math. 91, 207 210), we estimate from above the Cheeger number of a finite connected graph G of small degree (2(G) 5) admitting sufficiently distant edges. ## 2001 Academic Press Let G=(V(G), E(G)) be a finite connected graph. The Cheeger numb

An upper bound on the path number of a d

An upper bound on the path number of a digraph

✍ Richard C O'Brien 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 431 KB

A new hierarchy of upper and lower bound

A new hierarchy of upper and lower bounds on expectation values

✍ U. Brandt; J. Stolze 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 540 KB

Improving an Upper Bound on the Stabilit

Improving an Upper Bound on the Stability Number of a Graph

✍ Carlos J. Luz 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 494 KB