On determining a computable ordering of a digital network
M.A. Comeau, Krishnaiya Thulasiraman · Proceedings of the IEEE · 1983
The problem of determining a computable ordering (whenever it exists) of a digital network is shown to be the same as a well-known problem in Computer Science and Graph Theory literature, namely, the problem of topologically sorting the nodes of an acyclic directed graph.