Fast algorithms to enumerate all common intervals of two permutations (Q1969959): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:38, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms to enumerate all common intervals of two permutations |
scientific article |
Statements
Fast algorithms to enumerate all common intervals of two permutations (English)
0 references
19 March 2000
0 references
common intervals of permutations
0 references
random permutations
0 references
