๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on linear expected time algorithms for finding convex hulls

โœ Scribed by L. Devroye; G. T. Toussaint

Publisher
Springer Vienna
Year
1981
Tongue
English
Weight
288 KB
Volume
26
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A note on convex hull algorithms
A note on convex hull algorithms
โœ S.K. Ghosh ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 62 KB
A simple linear expected time algorithm
A simple linear expected time algorithm for finding a hamilton path
โœ Andrew Thomason ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 496 KB

Discrete Mathematics 75 (1989) 373-379 North-Holland n?", so the problem is one of finding a fast algorithm which works on all graphs in %(n, p) except for a proportion somewhat smaller than 2~". This will be our algorithm A2. A very fast algorithm, which works on most graphs but not on as many as A