𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A bit-pushing shortest distance algorithm

✍ Scribed by A. Rosenthal

Publisher
John Wiley and Sons
Year
1975
Tongue
English
Weight
245 KB
Volume
5
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A bit manipulation method is given for finding shortest distances from an origin in an unweighted graph, or alternatively, for finding connected components. The basic approach is similar to some component algorithms already in the literature but an easy implementation is given that overcomes the problem which prevents the others from being efficient–namely, the problem of identifying the ones in a sparse bit string without checking all the bits. The algorithm would be most effective for moderate sized graphs (about 20–100 nodes). Computational results are given.

πŸ“œ SIMILAR VOLUMES

Distance Transform Algorithm for Bit-Ser
Distance Transform Algorithm for Bit-Serial SIMD Architectures
✍ Jarmo H Takala; Jouko O Viitanen πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 172 KB

A distance transform converts a binary image consisting of foreground (feature) and background (nonfeature) elements into a gray level image, where each element contains the distance from the corresponding element to the nearest foreground element. The calculation of exact Euclidean distance transfo

A bicriterion shortest path algorithm
A bicriterion shortest path algorithm
✍ JoΓ£o Carlos Namorado Climaco; Ernesto QueirΓ³s Vieira Martins πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 386 KB
Determination of shortest distance to vo
Determination of shortest distance to voltage instability with particle swarm optimization algorithm
✍ M. J. Chen; B. Wu; C. Chen πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 109 KB

## Abstract Loading margin denotes how close the power system is to voltage instability. This paper presents a new technique to obtain the shortest distance to voltage instability, which converts the computation of the closest point of collapse to an optimization problem. Compared with the existing