Title :
On determining a computable ordering of a digital network
Author :
Comeau, Marc ; Thulasiraman, K.
Author_Institution :
Concordia University, Montreal, Canada
Abstract :
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.
Keywords :
Computer networks; Frequency; Least squares approximation; Sampling methods; Sorting;
Journal_Title :
Proceedings of the IEEE
DOI :
10.1109/PROC.1983.12766
