Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
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.
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
Daniel M. Bikel, Vittorio Castelli
ACL 2008