✦ LIBER ✦

An optimal algorithm for sink-finding

✍ Scribed by K.N. King; Barbara Smith-Thomas

Book ID: 118323795
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 364 KB
Volume: 14
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(82)90064-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal algorithm for finding compact

An optimal algorithm for finding compact sets

✍ Eliezer Dekel; Jie Hu; Wen Onyang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 388 KB

An optimal algorithm for finding minimal

An optimal algorithm for finding minimal enclosing triangles

✍ Joseph O'Rourke; Alok Aggarwal; Sanjeev Maddila; Michael Baldwin 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 615 KB

An algorithm for finding optimal integra

An algorithm for finding optimal integration lattices of composite order

✍ J. N. Lyness; T. Sørevik 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 736 KB

An optimal algorithm for finding dominat

An optimal algorithm for finding dominating cycles in circular-arc graphs

✍ J.Mark Keil; Doug Schaefer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 972 KB

Finding the Sink Takes Some Time: An Alm

Finding the Sink Takes Some Time: An Almost Quadratic Lower Bound for Finding the Sink of Unique Sink Oriented Cubes

✍ Ingo Schurr; Tibor Szabó 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 271 KB

An optimal algorithm for finding an encl

An optimal algorithm for finding an enclosing planar rectilinear annulus of minimum width

✍ Olga N. Gluchshenko; Horst W. Hamacher; Arie Tamir 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 807 KB

Given a set P of n points in the plane, we consider the problem of finding a planar rectilinear annulus of minimum width which encloses the set P. We present an optimal O(n log n) algorithm for this problem.