Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
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
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Conference paper
A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering