✦ LIBER ✦

Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs

✍ Scribed by Slivkins, Aleksandrs

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear time algorithms for two disjoint

✍ Tholey, Torsten 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 646 KB

A note on approximating the min–max vert

✍ Bang Ye Wu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 124 KB

On the complexity of the planar directed

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

Inapproximability of Edge-Disjoint Paths

✍ Matthew Andrews; Julia Chuzhoy; Venkatesan Guruswami; Sanjeev Khanna; Kunal Talw 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 441 KB

On Partitioning the Edge Set of a Graph

✍ G. R. Vijayakumar 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 206 KB

On the equivalence in complexity among t

✍ Pen Cheng; Shigeru Masuyama 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 396 KB