✦ LIBER ✦

Linear expected time of a simple union-find algorithm

✍ Scribed by Jon Doyle; Ronald L. Rivest

Book ID: 113161856
Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 446 KB
Volume: 5
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(76)90061-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A note on linear expected time algorithm

A note on linear expected time algorithms for finding convex hulls

✍ L. Devroye; G. T. Toussaint 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 288 KB

A simple linear-time algorithm for findi

A simple linear-time algorithm for finding path-decompositions of small width

✍ Kevin Cattell; Michael J. Dinneen; Michael R. Fellows 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 601 KB

A Practical Shortest Path Algorithm with

A Practical Shortest Path Algorithm with Linear Expected Time

✍ Goldberg, Andrew V. 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 220 KB

A linear-time algorithm to find modules

A linear-time algorithm to find modules of fault trees

✍ Dutuit, Y.; Rauzy, A. 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 376 KB

Expected time analysis of interpolation

Expected time analysis of interpolation merge — a simple new merging algorithm

✍ Sumanta Guha; Arunabha Sen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 447 KB