Efficient Algorithms for Finding the Max
✍
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