Pages that link to "Item:Q1906146"
From MaRDI portal
The following pages link to Partitioning permutations into increasing and decreasing subsequences (Q1906146):
Displaying 17 items.
- On compressing permutations and adaptive sorting (Q391981) (← links)
- Sorting with networks of data structures (Q602673) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- Satgraphs and independent domination. I (Q818113) (← links)
- Partitioning permutations into monotone subsequences (Q820846) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- Partitioning graphs into complete and empty graphs (Q1045126) (← links)
- Generalized split graphs and Ramsey numbers (Q1380352) (← links)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
- Partitioning cographs into cliques and stable sets (Q2568333) (← links)
- Unsplittable classes of separable permutations (Q2629491) (← links)
- A Brooks‐Type Theorem for the Bichromatic Number (Q3466343) (← links)
- Generalized Coloring of Permutations (Q5009614) (← links)
- Growth rates of permutation grid classes, tours on graphs, and the spectral radius (Q5251615) (← links)
- (Q5421713) (← links)
- Restricted permutations (Q5906401) (← links)
- Generalized coloring of permutations (Q6582372) (← links)