Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation

DOI10.1016/S0196-6774(03)00017-8zbMath1045.68108arXivcs/0207027OpenAlexW3103878586MaRDI QIDQ4420421

Boaz Tsaban

Publication date: 17 August 2003

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0207027

zbMATH Keywords

Permutation graphsCycle structureFast forward permutationsPseudorandom permutations

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Decompositions of graphs of functions and fast iterations of lookup tables ⋮ Efficient computation of the iteration of functions ⋮ THE CONJUGACY PROBLEM AND RELATED PROBLEMS IN LATTICE-ORDERED GROUPS

This page was built for publication: Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation