✦ LIBER ✦

Efficient algorithms for finding sills in digital topographic maps

✍ Scribed by Thomas D. Otto; Andreas M. Thurnherr

Book ID: 113511098
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 610 KB
Volume: 33
Category: Article
ISSN: 0098-3004
DOI: 10.1016/j.cageo.2006.10.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for finding minimum

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

✍ Harold N. Gabow; Zvi Galil; Thomas Spencer; Robert E. Tarjan 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 939 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

Efficient algorithms for finding the cen

Efficient algorithms for finding the centers of conics and quadrics in noisy data

✍ Chanchal Chatterjee; Edwin K.P. Chong 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 36 KB

Efficient algorithms for finding maximum

Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems

✍ W. Lipski; F. P. Preparata 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 965 KB

Efficient algorithms for finding the cen

Efficient algorithms for finding the centers of conics and quadrics in noisy data

✍ Chanchal Chatterjee; Edwin K.P. Chong 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 958 KB

Efficient systolic algorithm for finding

Efficient systolic algorithm for finding bridges in a connected graph

✍ M Zubair; B.B Madan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 472 KB