Thomas R. Puzak, A. Hartstein, et al.
CF 2007
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
FPGA-based coprocessor for text string extraction
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014