David A. Selby
IBM J. Res. Dev
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.
David A. Selby
IBM J. Res. Dev
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory