Fast algorithms to enumerate all common intervals of two permutations (Q1969959): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Mutsunori Yagiura / rank | |||
| Property / author | |||
| Property / author: Mutsunori Yagiura / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s004539910014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044007697 / rank | |||
Normal rank | |||
Latest revision as of 19:22, 19 March 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
