Fast algorithms to enumerate all common intervals of two permutations (Q1969959): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s004539910014 / rank | |||
| 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 | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S004539910014 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:51, 16 December 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
