✦ LIBER ✦

An algorithm for computing the number of the minimal paths in digital images

✍ Scribed by P.P. Das

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 450 KB
Volume: 9
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(89)90043-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the shape of a point set in di

Computing the shape of a point set in digital images

✍ S.K. Parui; S. Sarkar; B.B. Chaudhuri 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 363 KB

An algorithm for determining the best pa

An algorithm for determining the best path in a computer communication network

✍ V.K. Jain; Krishna Gopal 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 243 KB

An algorithm for the ranking of shortest

An algorithm for the ranking of shortest paths

✍ JoséAugusto Azevedo; Maria Emília O. Santos Costa; Joaquim João E.R. Silvestre M 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 631 KB

An efficient algorithm for the computati

An efficient algorithm for the computation of the canonical numbering of reaction matrices

✍ Josef Brandt; Annette von Scholley 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 759 KB

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

The Minimal Euclidean Norm of an Algebra

The Minimal Euclidean Norm of an Algebraic Number Is Effectively Computable

✍ M. Filaseta; M.L. Robinson; F.S. Wheeler 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 868 KB