๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Temporal resolution using a breadth-first search algorithm

โœ Scribed by Clare Dixon


Book ID
110379860
Publisher
Springer Netherlands
Year
1998
Tongue
English
Weight
258 KB
Volume
22
Category
Article
ISSN
1012-2443

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Shortest path algorithms using dynamic b
โœ Donald Goldfarb; Jianxiu Hao; Sheng-Roan Kai ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 1022 KB

A new O(nm) label-correcting algorithm is presented for finding shortest paths from a given node to all other nodes in a network of n nodes and m arcs or finding a directed cycle of negative length. In this algorithm, a node is scanned on the k-th scanning step only if its "label depth"-i.e., the le

Breadth-first heuristic search
โœ Rong Zhou; Eric A. Hansen ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 202 KB