Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
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
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005