Katriel, Irit Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Kutz, Martin Algorithms and Complexity, MPI for Informatics, Max Planck Society;
MPI-I-2005-1-007.pdf (全文テキスト(全般)), 238KB
Katriel, I., & Kutz, M.(2005). A faster algorithm for computing a longest common increasing subsequence (MPI-I-2005-1-007). Saarbrücken: Max-Planck-Institut für Informatik.