Author:
Ibrahim M. S.,Maculan N.,Minoux M.
Publisher
Springer Science and Business Media LLC
Reference20 articles.
1. Bellman, R.: On routing problem. Q. Appl. Math. 16, 87–90 (1958)
2. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)
3. Ford, L.R., Jr.: Networks flow theory. Paper P-923, The RAND Corporation, Santa Monica, California, [August 14] (1956)
4. Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10, 111–121 (1980)
5. Garey, M., Johnson, D.: Computer and Intractibility: a guide to the theory of NP-completeness. Freeman, San Francisco (1979)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献