Constant time and space updates for the sigma-tau problem
From MaRDI portal
Publication:6545441
DOI10.1007/978-3-031-43980-3_26MaRDI QIDQ6545441
Zsuzsanna Lipták, Aaron Williams, Francesco Masillo, Gonzalo Navarro
Publication date: 29 May 2024
permutationsdynamic data structurescombinatorial generationcombinatorial Gray codessigma-tau problem
Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Succinct representations of permutations and functions
- Faster entropy-bounded compressed suffix trees
- The coolest way to generate combinations
- Shorthand universal cycles for permutations
- r-indexing the eBWT
- Permutation patterns in genome rearrangement problems: the reversal model
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
- A Simple Proof of Rankin's Campanological Theorem
- An explicit universal cycle for the ( n -1)-permutations of an n -set
- Indexing compressed text
- Faster algorithms for sorting by transpositions and sorting by block interchanges
- Doubly adjacent gray codes for the symmetric group
- A Survey of Combinatorial Gray Codes
- Sorting by Transpositions
- Genome Rearrangements and Sorting by Reversals
- Solving the Sigma-Tau Problem
- Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
- Containing All Permutations
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Syntactic view of sigma-tau generation of permutations
- Combinatorial Gray codes -- an updated survey
Related Items (2)
Generating signed permutations by twisting two-sided ribbons ⋮ On the hardness of Gray code problems for combinatorial objects
This page was built for publication: Constant time and space updates for the sigma-tau problem
