M.F. Cowlishaw
IBM Systems Journal
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
Conference paper
Performance measurement and data base design
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014