Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering
A "node list" of a directed graph is a sequence of nodes such that every simple path in the graph is a subsequence of the node list. This paper gives three relatively simple algorithms for computing node lists. Previous results are summarized, and areas for further work are suggested. © 1978.
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering
B.K. Boguraev, Mary S. Neff
HICSS 2000
Thomas M. Cover
IEEE Trans. Inf. Theory
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975