Author:
Bonizzoni Paola,Della Vedova Gianluca,Dondi Riccardo,Fertin Guillaume,Vialette Stéphane
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoretical Computer Science 237(1–2), 123–134 (2000)
2. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters 8(3), 121–123 (1979)
3. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
4. Hakata, K., Imai, H.: The longest common subsequence problem for small alphabet size between many strings. In: Proc. 3rd International Symp. on Algorithms and Computation (ISAAC), pp. 469–478 (1992)
5. Hsu, W., Du, M.: New algorithms for the LCS problem. Journal of Computer and System Sciences 19, 133–152 (1984)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献