Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
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
Conference paper
Modeling polarization for Hyper-NA lithography tools and masks
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
Conference paper
Some experimental results on placement techniques
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976