✦ LIBER ✦

The Maximum Edge-Disjoint Paths Problem in Bidirected Trees

✍ Scribed by Erlebach, Thomas; Jansen, Klaus

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximum edge-disjoint paths problem

✍ Adrian Kosowski 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 426 KB

On the maximum disjoint paths problem on

✍ Bang Ye Wu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 298 KB

Finding Edge-Disjoint Paths in Partialk-

✍ X. Zhou; S. Tamura; T. Nishizeki 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 339 KB

Simple On-Line Algorithms for the Maximu

✍ Petr Kolman; Christian Scheideler 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 380 KB

On the complexity of the planar directed

✍ Dirk Müller 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 278 KB

The disjoint paths problem in quadratic

✍ Ken-ichi Kawarabayashi; Yusuke Kobayashi; Bruce Reed 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 187 KB