✦ LIBER ✦

Alternating paths through disjoint line segments

✍ Scribed by Michael Hoffmann; Csaba D Tóth

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 265 KB
Volume: 87
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(03)00349-1

No coin nor oath required. For personal study only.

✦ Synopsis

We show that every segment endpoint visibility graph on n disjoint line segments in the plane admits an alternating path of length (log n), and this bound is optimal apart from a constant factor.

📜 SIMILAR VOLUMES

Alternating Paths along Axis-Parallel Se

Alternating Paths along Axis-Parallel Segments

✍ Csaba D. Tóth 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 268 KB

Location game on disjoint line segments

✍ Marcin Dziubiński 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 408 KB

Shortest paths for line segments

✍ Christian Icking; Günter Rote; Emo Welzl; Chee Yap 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 1007 KB

Illuminating Disjoint Line Segments in t

Illuminating Disjoint Line Segments in the Plane

✍ Csaba D. Tóth 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 280 KB

On line disjoint paths of bounded length

✍ Geoffrey Exoo 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 105 KB

In a recent paper Lovfisz, Neumann-Lara and Plummer proved some Mengerian theorems for paths of bounded length. In this note the line connectivity analogue of their problem "is considered. In [3] Lovfisz, Neumann-Lara and Plummer considered the problem of extending Monger's theorem to paths of boun

Construction of vertex-disjoint paths in

Construction of vertex-disjoint paths in alternating group networks

✍ Shuming Zhou; Wenjun Xiao; Behrooz Parhami 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 708 KB