✦ LIBER ✦

Two Edge-Disjoint Hop-Constrained Paths and Polyhedra

✍ Scribed by Huygens, David; Mahjoub, Ali Ridha; Pesneau, Pierre

Book ID: 118197217
Publisher: Society for Industrial and Applied Mathematics
Year: 2004
Tongue: English
Weight: 305 KB
Volume: 18
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480102419445

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The edge-disjoint 3-hop-constrained path

The edge-disjoint 3-hop-constrained paths polytope

✍ F. Bendali; I. Diarrassouba; A.R. Mahjoub; J. Mailfert 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 464 KB

On the edge-disjoint 2-hop-constrained p

On the edge-disjoint 2-hop-constrained paths polytope

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

Two Node-Disjoint 3-Hop-Constrained Surv

Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra

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

Vertex-disjoint paths and edge-disjoint

Vertex-disjoint paths and edge-disjoint branchings in directed graphs

✍ R. W. Whitty 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB

A theorem of J. Edmonds states that a directed graph has k edge-disjoint branchings rooted at a vertex r if and only if every vertex has k edge-disjoint paths to r . We conjecture an extension of this theorem to vertex-disjoint paths and give a constructive proof of the conjecture in the case k = 2.

Edge-Disjoint Paths in Expander Graphs

✍ Frieze, Alan M. 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 170 KB

Tree metrics and edge-disjoint\(S\)-path

Tree metrics and edge-disjoint\(S\)-paths

✍ Hirai, Hiroshi; Pap, Gyula 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 614 KB