✦ LIBER ✦

The cover time of a regular expander is O(n log n)

✍ Scribed by Ronitt Rubinfeld

Book ID: 103106028
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 244 KB
Volume: 35
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90173-u

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding the upper envelope of n line seg

Finding the upper envelope of n line segments in O(n log n) time

✍ John Hershberger 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 897 KB

An O(n-log-log-n) Time Algorithm for Con

An O(n-log-log-n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees

✍ T. Asano 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 601 KB

Computation of geometric properties from

Computation of geometric properties from the medial axis transform in O(n log n) time

✍ Angela Y Wu 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 93 KB

The Maximum Number of Times the Same Dis

The Maximum Number of Times the Same Distance Can Occur among the Vertices of a Convex n-gon Is O(n log n)

✍ Peter Braß; János Pach 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 70 KB

Proof. Denote by f (n) the maximum number of times the unit distance can occur among n points in convex position in the plane. Let p 1 , p 2 , ..., p n , in this cyclic order, be the vertices of a convex polygon, for which the maximum is attained. Let G denote the geometric graph obtained by connect

A new O(n·log n) algorithm for computing

A new O(n·log n) algorithm for computing the intersection of convex polygons

✍ Sukhamay Kundu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 441 KB

A parallel O(log n) algorithm for the dr

A parallel O(log n) algorithm for the drawing of algebraic curves in an n × n square

✍ R. Sommerhalder; S.C. Van Westrhenen 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 477 KB