On the longest upsequence problem for permutations

International Journal of Computer Mathematics

Volumn 77, Issue 1, 2001, Pages 45-53

  Makinen E ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

Algorithms; Permutation; Stratified tree; Upsequence; Young tableau

Indexed keywords

ALGORITHMS; GRAPH THEORY; NUMBER THEORY; SET THEORY; TREES (MATHEMATICS);

PERMUTATIONS; UPSEQUENCE;

PROBLEM SOLVING;

EID: 0034958183     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207160108805049     Document Type: Article

References (13)

1. Restricted permutations
2. Pattern matching for permutations
3. Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
4. A combinatorial problem in geometry
5. Finding pattern matchings for permutations
6. Algorithms in a restricted universe. Dept. of Computer Science. University of Waterloo
7. Bounded ordered dictionaries in O(log log n) time and O(n) space
8. Longest increasing and decreasing subsequences
9. Preserving order in a forest in less than logarithmic time and linear space