𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes

✍ Scribed by Juraj Hromkovič; Ralf Klasing; Walter Unger; Hubert Wagener

Book ID
112252269
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
568 KB
Volume
133
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Near-optimal hardness results and approx
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
✍ Venkatesan Guruswami; Sanjeev Khanna; Rajmohan Rajaraman; Bruce Shepherd; Mihali 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 308 KB

We study the approximability of edge-disjoint paths and related problems. In the edge-disjoint paths (EDP) problem, we are given a network G with source-sink pairs ðs i ; t i Þ; 1pipk; and the goal is to find a largest subset of source-sink pairs that can be simultaneously connected in an edge-disjo

A simple linear algorithm for the edge-d
A simple linear algorithm for the edge-disjoint (s, t)-paths problem in undirected planar graphs
✍ Laurent Coupry 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Let G = (v!E) be an undirected planar graph, and s, 1 E V, s # f. We present a linear algorithm to compute a set of edge-disjoint (s, t)-paths of maximum cardinality in G. In other words, the problem is to find a maximum unit flow from s to r in a non-weighted graph. The main purpose is not to show