𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Searching networks with unrestricted edge costs

✍ Scribed by Dasgupta, P.; Sen, A.K.; Nandy, S.C.; Bhattacharya, B.B.

Book ID
117874183
Publisher
IEEE
Year
2001
Tongue
English
Weight
245 KB
Volume
31
Category
Article
ISSN
1083-4427

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Binary Searching with Nonuniform Cost
On Binary Searching with Nonuniform Costs
✍ Laber, Eduardo S.; MilidiΓΊ, Ruy L.; Pessoa, Artur A. πŸ“‚ Article πŸ“… 2002 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 282 KB
Searching with mobile agents in networks
Searching with mobile agents in networks with liars
✍ Nicolas Hanusse; Evangelos Kranakis; Danny Krizanc πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 261 KB

We present deterministic algorithms to search for an item s contained in a node of a network, without prior knowledge of its exact location. Each node of the network has a database that will answer queries of the form "how do I get to s?" by responding with the ΓΏrst edge on a shortest path to the no