Encoding shortest paths in graphs assuming the code is queried using bit-wise comparison

Gokce Caylak Kayaturan, Alexei Vernitski

One model of message delivery in a computer network is based on labelling each edge by a subset of a (reasonably small) universal set, and then encoding a path as the union of the…