Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
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
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006