✦ LIBER ✦

Finding a Path of Superlogarithmic Length

✍ Scribed by Björklund, Andreas; Husfeldt, Thore

Book ID: 118181208
Publisher: Society for Industrial and Applied Mathematics
Year: 2003
Tongue: English
Weight: 165 KB
Volume: 32
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539702416761

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding a Length-Constrained Maximum-Den

Finding a Length-Constrained Maximum-Density Path in a Tree

✍ Rung-Ren Lin; Wen-Hsiung Kuo; Kun-Mao Chao 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 152 KB

Finding Paths and Cycles of Superpolylog

Finding Paths and Cycles of Superpolylogarithmic Length

✍ Gabow, Harold N. 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 288 KB

The complexity of finding maximum disjoi

The complexity of finding maximum disjoint paths with length constraints

✍ A. Itai; Y. Perl; Y. Shiloach 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB

Sarah Winters: Finding a Path

✍ Briggs, Jason A 📂 Fiction 📅 2016 🏛 Tyamina Publishing 🌐 English ⚖ 30 KB

Overview: Sarah Winters is standing at the crossroads of her life's path.

The expected length of a shortest path

✍ Robert Davis; Armand Prieditis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 568 KB

Finding a manhattan path and related pro

Finding a manhattan path and related problems

✍ Witold Lipski Jr. 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 599 KB

Let S be a set of n horizontal and vertical segments on the plane, and let s, t E S. A Manhattan path (of length k ) from s to t is an alternating sequence of horizontal and vertical segments s = ro, rl, . . . , rk = t where ri intersects ri+, , 0 < i < k . An from all s ES to r. Also given is a met