Algorithms and Computation
Springer Berlin Heidelberg
Chapter title |
Efficient Algorithms for Finding a Longest Common Increasing Subsequence
|
---|---|
Chapter number | 67 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, December 2005
|
DOI | 10.1007/11602613_67 |
Book ISBNs |
978-3-54-030935-2, 978-3-54-032426-3
|
Authors |
Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu, Chan, Wun-Tat, Zhang, Yong, Fung, Stanley P. Y., Ye, Deshi, Zhu, Hong |