Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
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
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Conference paper
Modeling polarization for Hyper-NA lithography tools and masks
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007