Sciweavers

JDA
2008
67views more  JDA 2008»
13 years 5 months ago
On minimum k-modal partitions of permutations
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result
Gabriele Di Stefano, Stefan Krause, Marco E. L&uum...