An algorithm for solving the longest increasing circular subsequence problem (Q987842): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2009.02.019
+Normal rank
@@ Property / OpenAlex ID @@
+W1990084682
@@ Property / OpenAlex ID: W1990084682 / rank @@
+Normal rank
@@ Property / cites work @@
+On the longest increasing subsequence of a circular list
+Normal rank
@@ Property / cites work @@
+Longest increasing subsequences in sliding windows
+Normal rank
@@ Property / cites work @@
+Longest increasing subsequences in windows based on canonical antichain partition
+Normal rank
@@ Property / cites work @@
+Design and implementation of an efficient priority queue
+Normal rank
@@ Property / cites work @@
+Semi-local string comparison: algorithmic techniques and applications
+Normal rank