On the longest upsequence problem for permutations

References

• Atkinson , M.D. 1999 . Restricted permutations . Discrete Math. , 195 : 27 – 38 .
   Google Scholar
• Bose , Brosejint , Buss , Jonathan F. and Lubiw , Anna . 1998 . Pattern matching for permutations . Inform. Process. Lett , 65 : 227 – 283 .
   Google Scholar
• Chang , Maw-Shang and Wang , Fu-Hsing . 1992 . Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs . Inform. Process. Lett. , 43 : 293 – 295 .
   Web of Science ®Google Scholar
• Erdös , P. and Szekeres , G. 1935 . A combinatorial problem in geometry . Compositio Math. , 2 : 463 – 470 .
   Google Scholar
• Charles Golumbic , Martin . 1980 . Algorithmic Graph Theory and Perfect Graphs , Academic Press .
   Google Scholar
• Gries , David . 1981 . The Science of Programming , Springer .
   Google Scholar
• Ibarra , Louis . 1997 . Finding pattern matchings for permutations . Inform. Process. Lett. , 61 : 293 – 295 .
   Google Scholar
• Karlsson , Rolf G. November 1984 . Algorithms in a restricted universe , November , University of Waterloo . Dept of Computer Science, Research Report CSS4-50
   Google Scholar
• Kunth , Donald E. 1998 . The Art of Computer Programming , Vol. 3 , Addison-Wesley . Second Edition
   Google Scholar
• Mehlhorn , Kurt . 1984 . Data Structures and Algorithms I: Sorting and Searching , Springer .
   Google Scholar
• Mehlhorn , Kurt and Näher , Stefan . 1990 . Bounded ordered dictionaries in O(log logn)time and O (n) space . Inform. Process. Lett. , 35 : 183 – 189 .
   Google Scholar
• Schensted , K. 1961 . Longest increasing and decreasing subsequences . Canad. J. Math. , 13 : 179 – 191 .
   Web of Science ®Google Scholar
• Boas Van Emde , P. 1977 . Preserving order in a forest in less than logarithmic time and linear space . Inform. Process. Lett. , 6 : 80 – 82 .
   Google Scholar