Constant time generation of derangements (Q2390248): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.ipl.2004.02.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054943314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gray code for derangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for generating subsets of fixed size with a strong minimal change property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loopless generation of linear extensions of a poset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loopless Generation of Trees with Specified Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Multiset Permutations in Constant Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the loopless generation of binary tree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On O(1) Time Algorithms for Combinatorial Generation / rank
 
Normal rank

Latest revision as of 20:01, 1 July 2024

scientific article
Language Label Description Also known as
English
Constant time generation of derangements
scientific article

    Statements