Pages that link to "Item:Q1119638"

The following pages link to An algorithm for the determination of longest increasing subsequence in a sequence (Q1119638):

Displaying 10 items.

• The longest almost-increasing subsequence (Q765507) (← links)
• A review of metrics on permutations for search landscape analysis (Q878593) (← links)
• The smallest upravel (Q1193744) (← links)
• Drawing graphs in two layers (Q1331939) (← links)
• The analysis of evolutionary algorithms on sorting and shortest paths problems (Q1774629) (← links)
• Space-efficient algorithms for longest increasing subsequence (Q1987516) (← links)
• A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem (Q2444738) (← links)
• On the longest upsequence problem for permutations (Q2731076) (← links)
• Space-Efficient Algorithms for Longest Increasing Subsequence (Q3304143) (← links)
• A CGM Algorithm Solving the Longest Increasing Subsequence Problem (Q3603018) (← links)