Journal of the ACM Bibliography
Robert Endre Tarjan. Fast
algorithms for solving path problems. Journal of the ACM,
28(3):594-614, July 1981.
[BibTeX entry]
Selected papers that cite this one
- Alberto O. Mendelzon and Peter T. Wood. Finding regular
simple paths in graph databases. SIAM Journal on
Computing, 24(6):1235-1258, December 1995.
- Borislav Nikolik. Constraint preservation
through loops. Information Processing Letters,
55(3):143-148, 11 August 1995.
- Vugranam C. Sreedhar, Guang R. Gao, and Yong-fong Lee. A new framework for
exhaustive and incremental data flow analysis using DJ graphs. In
Proceedings of the ACM SIGPLAN '96 Conference on Programming
Language Design and Implementation, pages 278-290, Philadelphia,
Pennsylvania, 21-24 May 1996. SIGPLAN Notices 31(5), May 1996.
Shortcuts: