Fan Zhang, Junwei Cao, et al.
IEEE TETC
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.
Fan Zhang, Junwei Cao, et al.
IEEE TETC
David S. Kung
DAC 1998
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000