𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simple On-Line Algorithms for the Maximum Disjoint Paths Problem

✍ Scribed by Petr Kolman; Christian Scheideler

Book ID
106148537
Publisher
Springer
Year
2004
Tongue
English
Weight
380 KB
Volume
39
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient Algorithms for Finding the Max
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
✍ Wun-Tat Chan; Francis Y.L. Chin πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 366 KB

In a rectangular grid, given two sets of nodes, S S sources and T T sinks , of size 2 Ε½ . each, the disjoint paths DP problem is to connect as many nodes in S S to the Ε½ nodes in T T using a set of ''disjoint'' paths. Both edge-disjoint and Β¨ertex-disjoint . cases are considered in this paper. Note

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