Lexicographic ranking and unranking of derangements in cycle notation (Q2636806): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2013.10.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966758584 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Gray code for derangements / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Who solved the secretary problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Constant time generation of derangements / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ranking and unranking permutations in linear time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3225387 / rank | |||
Normal rank | |||
Latest revision as of 09:18, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lexicographic ranking and unranking of derangements in cycle notation |
scientific article |
Statements
Lexicographic ranking and unranking of derangements in cycle notation (English)
0 references
18 February 2014
0 references
combinatorial problem
0 references
algorithm
0 references
derangements
0 references
ranking
0 references
unranking
0 references
