On the longest increasing subsequence of a circular list
Information Processing Letters (2007)
- ISSN: 00200190
- DOI: 10.1016/j.ipl.2006.08.003
Available from linkinghub.elsevier.com
or
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
Start using Mendeley in seconds!
Readership Statistics
2 Readers on Mendeley
by Discipline
by Academic Status
50% Ph.D. Student
50% Student (Postgraduate)
by Country
50% India
50% China