Yao Qi, Raja Das, et al.
ISSTA 2009
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.
Yao Qi, Raja Das, et al.
ISSTA 2009
Thomas M. Cover
IEEE Trans. Inf. Theory
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering