𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for finding paths with multiple constraints

✍ Scribed by Jeffrey M. Jaffe

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
992 KB
Volume
14
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Algorithm for finding optimum path in
An Algorithm for finding optimum path in networks
✍ Kabekode V.S. Bhat πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 242 KB

In this paper we present an O((V( . loglV() algorithm forfinding an optimum path between two nodes in an edge-sparse network using a new approach. The method exploits the data structure and a simple breadth-first search process.

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