Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
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
Lixi Zhou, Jiaqing Chen, et al.
VLDB
Conference paper
A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008