Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
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.
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Zohar Feldman, Avishai Mandelbaum
WSC 2010
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009