𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm

✍ Scribed by Peter Damaschke; Jitender S. Deogun; Dieter Kratsch; George Steiner


Book ID
104813759
Publisher
Springer Netherlands
Year
1992
Tongue
English
Weight
520 KB
Volume
8
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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