Improvised divide and conquer approach for the LIS problem
type: Item
instance of: scholarly article
title: Improvised divide and conquer approach for the LIS problem
zbMATH Open document ID: 1391.68130
author: Seema Rani
author: Dharmveer Singh Rajpoot
published in: Journal of Discrete Algorithms
publication date: 2018-05-09T00:00:00Z
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 6867172
zbMATH Keywords: divide-and-conquer
zbMATH Keywords: longest increasing subsequence
zbMATH Keywords: principal row of Young tableaux
describes a project that uses: MUMMER
MaRDI profile type: Publication
full work available at URL: j.jda.2018.01.001
OpenAlex ID: W2792575467
cites work: A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
cites work: On the longest increasing subsequence of a circular list
cites work: Longest increasing subsequences in sliding windows
cites work: Enumerating longest increasing subsequences and patience sorting
cites work: Longest increasing subsequences in windows based on canonical antichain partition
cites work: Q3651735
cites work: Fast computation of a longest increasing subsequence and application
cites work: An algorithm for solving the longest increasing circular subsequence problem
cites work: The longest almost-increasing subsequence
cites work: On computing the length of longest increasing subsequences
cites work: Q4529547
cites work: Longest Increasing and Decreasing Subsequences
cites work: The constrained longest common subsequence problem
cites work: Preserving order in a forest in less than logarithmic time and linear space
DOI: 10.1016/J.JDA.2018.01.001
Recommended article: A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
Recommended article: Algorithmic approach to the split problems
Recommended article: Solving large scale combinatorial optimization problems based on a divide and conquer strategy
Recommended article: Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
Recommended article: Improved algorithms for path partition and related problems
Recommended article: Q4953333
Recommended article: Implicit and explicit algorithms for solving the split feasibility problem
Recommended article: Applications of a strategy for designing divide-and-conquer algorithms
Recommended article: New efficient algorithms for the LCS and constrained LCS problems
description: scientific article; zbMATH DE number 6867172