A multi-stack method for the fast generation of permutations with minimal length increasing subsequences (Q294635)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A multi-stack method for the fast generation of permutations with minimal length increasing subsequences |
scientific article; zbMATH DE number 6594028
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A multi-stack method for the fast generation of permutations with minimal length increasing subsequences |
scientific article; zbMATH DE number 6594028 |
Statements
A multi-stack method for the fast generation of permutations with minimal length increasing subsequences (English)
0 references
16 June 2016
0 references
combinatorial problems
0 references
listing algorithms
0 references
constant amortized time
0 references
0 references
0 references
