Publisher
Springer Berlin Heidelberg
Reference62 articles.
1. J. Beardwood, J.H. Halton and Ü.M. Hammersley, “The Shortest Path Through Many Points,” proc. Comb. Phil. Soc. 55 (1959), 299–327.
2. R. Bellman, “Combinatorial Processes and Dynamic Programming,” Proc. Tenth Symp. in Applied Math., American Mathematical Society (1960), 217–250.
3. C. Berge, “Two Theorems in Graph Theory,” Proa. Nat. Acad. Sci. 43 (1957), 842–844.
4. K.S. Booth and G.S. Lueker, “PQ-Tree Algorithms,” submitted to J. Comp, and Syst. Sci. (1975)
5. G.H. Bradley, “Equivalent Integer Programs and Canonical Problems,” Man. Sci. 17 (1971), 354–366.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Seed selection for successful fuzzing;Proceedings of the 30th ACM SIGSOFT International Symposium on Software Testing and Analysis;2021-07-11
2. Twisting Lattice and Graph Techniques to Compress Transactional Ledgers;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2018