Nanda Kambhatla
ACL 2004
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.
Nanda Kambhatla
ACL 2004
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008