𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum number of disjoint paths connecting specified terminals in a graph

✍ Scribed by Hananya Yinnone

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
907 KB
Volume
55
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Heuristics for finding a maximum number
Heuristics for finding a maximum number of disjoint bounded paths
✍ D. Ronen; Y. Perl πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 684 KB

We consider the following problem: Given an integer k and a network G with two distinct vertices s and t , find a maximum number of vertex disjoint paths from s to t of length bounded by k. In a recent work [ 91 it was shown that for length greater than four this problem is NP-hard. In this paper we

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