✦ LIBER ✦

The edge-disjoint 3-hop-constrained paths polytope

✍ Scribed by F. Bendali; I. Diarrassouba; A.R. Mahjoub; J. Mailfert

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the edge-disjoint 2-hop-constrained p

✍ Geir Dahl; David Huygens; A. Ridha Mahjoub; Pierre Pesneau 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Two Edge-Disjoint Hop-Constrained Paths

✍ Huygens, David; Mahjoub, Ali Ridha; Pesneau, Pierre 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 305 KB

Disjoint edge paths between given vertic

✍ S Gallivan 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 193 KB

Length 3 Edge-Disjoint Paths Is NP-Hard

✍ Alpert, Hannah; Iglesias, Jennifer 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 148 KB

Two Node-Disjoint 3-Hop-Constrained Surv

✍ Diarrassouba, Ibrahima; Kutucu, Hakan; Ridha Mahjoub, A. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 171 KB

The maximum edge-disjoint paths problem

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