Selected papers that cite this one
- Franz Höfting and Egon Wanke. Minimum cost paths in periodic graphs. SIAM Journal on Computing, 24(5):1051-1067, October 1995.
- David S. Johnson. The NP-completeness column: An ongoing guide. Journal of Algorithms, 2(4):393-405, December 1981.
- Y. Kesten, A. Pnueli, J. Sifakis, and S. Yovine. Decidable integration graphs. Accepted for publication in Information and Computation. Final manuscript received for publication October 16, 1998.