Partitioning a sequence into few monotone subsequences
From MaRDI portal
Publication:1130169
DOI10.1007/s002360050126zbMath0904.68078OpenAlexW1985516136MaRDI QIDQ1130169
Sergio Fogel, Reuven Bar Yehuda
Publication date: 8 November 1998
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002360050126
Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Related Items
Relating Graph Thickness to Planar Layers and Bend Complexity ⋮ A positive fraction Erdős-Szekeres theorem and its applications ⋮ Untangled monotonic chains and adaptive range search ⋮ A note on a Ramsey-type problem for sequences ⋮ On minimum \(k\)-modal partitions of permutations ⋮ A linear time approximation algorithm for permutation flow shop scheduling
This page was built for publication: Partitioning a sequence into few monotone subsequences
