Constant time generation of derangements

被引：9
|
作者：
Korsh, JF [1 ]
LaFollette, PS [1 ]
机构：
[1] Temple Univ, Dept CIS, Philadelphia, PA 19122 USA
来源：
INFORMATION PROCESSING LETTERS | 2004年 / 90卷 / 04期
关键词：
algorithms; combinatorial problems; loopless; derangements; Gray code; fixed points;
D O I：
10.1016/j.ipl.2004.02.006
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper presents the first constant time generation algorithm for derangements-permutations with no fixed points. Each derangement is obtained from its predecessor by making either one transposition or one rotation of three elements. It also generalizes this to permutations with a bounded number of fixed points. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：181 / 186
页数：6
相关论文
共 50 条
  • [1] On parallel generation of partial derangements, derangements and permutations
    Kokosinski, Zbigniew
    [J]. PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2008, 4967 : 219 - 228
  • [2] Constant time generation of linear extensions
    Ono, A
    Nakano, S
    [J]. FUNDAMENTALS OF COMPUTATIONAL THEORY, PROCEEDINGS, 2005, 3623 : 445 - 453
  • [3] CONSTANT TIME GENERATION OF FREE TREES
    WRIGHT, RA
    RICHMOND, B
    ODLYZKO, A
    MCKAY, BD
    [J]. SIAM JOURNAL ON COMPUTING, 1986, 15 (02) : 540 - 548
  • [4] Constant time generation of integer partitions
    Yamanaka, Katsuhisa
    Kawano, Shin-ichiro
    Kikuchi, Yosuke
    Nakano, Shin-ichi
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2007, E90A (05) : 888 - 895
  • [5] CONSTANT TIME GENERATION OF ROOTED TREES
    BEYER, T
    HEDETNIEMI, SM
    [J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (04) : 706 - 712
  • [6] Constant time generation of set partitions
    Kawano, S
    Nakano, S
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (04) : 930 - 934
  • [7] Linear-time generation of uniform random derangements encoded in cycle notation
    Mikawa, Kenji
    Tanaka, Ken
    [J]. DISCRETE APPLIED MATHEMATICS, 2017, 217 : 722 - 728
  • [8] Constant Time Generation of Trees with Degree Bounds
    Zhuang, Bingbing
    Nagamochi, Hiroshi
    [J]. OPERATIONS RESEARCH AND ITS APPLICATIONS, 2010, 12 : 183 - 194
  • [9] Constant time generation of trees with specified diameter
    Nakano, SI
    Uno, T
    [J]. GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2004, 3353 : 33 - 45
  • [10] Constant Time Generation of Biconnected Rooted Plane Graphs
    Zhuang, Bingbing
    Nagamochi, Hiroshi
    [J]. FRONTIERS IN ALGORITHMICS, 2010, 6213 : 113 - 123
12345