Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
Paper
Three simple node list algorithms
Abstract
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.
Related
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990