✦ LIBER ✦

Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs

✍ Scribed by J. Hromkovic; R. Klasing; E.A. Stohr; H. Wagener

Book ID: 112252184
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 903 KB
Volume: 123
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.1995.1154

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Improved algorithms for finding length-b

Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph

✍ Chih-Chiang Yu; Chien-Hsin Lin; Biing-Feng Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 323 KB

The Vertex-Disjoint Menger Problem in Pl

The Vertex-Disjoint Menger Problem in Planar Graphs

✍ Ripphausen-Lipa, Heike; Wagner, Dorothea; Weihe, Karsten 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 357 KB

Disjoint Paths in Graphs I,¶3-planar Gra

Disjoint Paths in Graphs I,¶3-planar Graphs and Basic Obstructions

✍ Xingxing Yu 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 268 KB

Edge-Disjoint Paths in Planar Graphs wit

Edge-Disjoint Paths in Planar Graphs with Constant Congestion

✍ Chekuri, Chandra; Khanna, Sanjeev; Shepherd, F. Bruce 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 333 KB

Polynomial time algorithm for constructi

Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs

✍ Satoshi Fujita 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 415 KB