(geometry) Any one of a class of circles with centre at (p/q, 1/(2q²)) and radius 1/(2q²), where p/q is an irreducible fraction (i.e., p and q are coprime integers).

(graph theory, computing) An algorithm that computes single-source shortest paths in a weighted digraph, capable (unlike the faster Dijkstra's algorithm) of handling graphs with negative edge weights.

plural of Bellman-Ford algorithm

A civil parish (served by Humber, Ford and Stoke Prior Parish Council) south-east of Leominster, Herefordshire, England.

A civil parish in Buckinghamshire, England.