✦ LIBER ✦

On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary

✍ Scribed by Werner Schwärzler

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of the planar directed

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

On the complexity of the disjoint paths

✍ Matthias Middendorf; Frank Pfeiffer 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 554 KB

On the complexity of vertex-disjoint len

✍ Andreas Bley 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 277 KB

On the equivalence in complexity among t

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

On the complexity of the one-terminal ne

✍ Nimrod Megiddo 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 225 KB

On Partitioning the Edge Set of a Graph

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