Pages that link to "Item:Q1058290"
From MaRDI portal
The following pages link to The complexity of finding minimum-length generator sequences (Q1058290):
Displaying 46 items.
- Sorting permutations by block-interchanges (Q673336) (← links)
- A review of metrics on permutations for search landscape analysis (Q878593) (← links)
- Computing short generator sequences (Q1090414) (← links)
- Sorting by bounded block-moves (Q1281770) (← links)
- Hash functions and Cayley graphs (Q1335422) (← links)
- Bisection width of transposition graphs (Q1392578) (← links)
- Sorting permutations with transpositions in \(O(n^3)\) amortized time (Q1731847) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- Diameter bounds and recursive properties of Full-Flag Johnson graphs (Q1752664) (← links)
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement (Q1902472) (← links)
- Cyclic group blocking polyhedra (Q1949270) (← links)
- Length-weighted \(\lambda\)-rearrangement distance (Q2025054) (← links)
- Sorting a permutation by best short swaps (Q2037101) (← links)
- Approximation algorithms for sorting permutations by length-weighted short rearrangements (Q2132329) (← links)
- Exploiting pseudo-locality of interchange distance (Q2146144) (← links)
- Cyclic shift problems on graphs (Q2232257) (← links)
- Approximation algorithms for sorting permutations by extreme block-interchanges (Q2235751) (← links)
- Swapping labeled tokens on graphs (Q2347003) (← links)
- Sorting on graphs by adjacent swaps using permutation groups (Q2374257) (← links)
- How to sort by walking and swapping on paths and trees (Q2408166) (← links)
- An approximation algorithm for genome sorting by reversals to recover all adjacencies (Q2424720) (← links)
- Multiple genome rearrangement by swaps and by element duplications (Q2456364) (← links)
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings (Q2482209) (← links)
- A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation (Q2630342) (← links)
- Cryptographic Hash Functions and Expander Graphs: The End of the Story? (Q2803636) (← links)
- Task swapping networks in distributed systems (Q2874305) (← links)
- The Time Complexity of the Token Swapping Problem and Its Parallel Variants (Q2980932) (← links)
- Growth in SL2 over finite fields (Q3007962) (← links)
- On minimizing the lengths of checking sequences (Q3417008) (← links)
- Swapping Colored Tokens on Graphs (Q3449858) (← links)
- Edit Distances and Factorisations of Even Permutations (Q3541123) (← links)
- The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant (Q4622770) (← links)
- UPPER BOUNDS FOR SORTING PERMUTATIONS WITH A TRANSPOSITION TREE (Q4928334) (← links)
- Exact upper bound for sorting Rn with LE (Q4965903) (← links)
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) (← links)
- (Q5089151) (← links)
- On the Strictness of a Bound for the Diameter of Cayley Graphs Generated by Transposition Trees (Q5867207) (← links)
- Sorting with fixed-length reversals (Q5961630) (← links)
- Sorting by prefix block-interchanges (Q6038693) (← links)
- Token Swapping on Trees (Q6045462) (← links)
- (Q6065464) (← links)
- Hypercube embeddings and Cayley graphs generated by transpositions (Q6091746) (← links)
- An algebraic model for inversion and deletion in bacterial genome rearrangement (Q6112440) (← links)
- Particle computation: complexity, algorithms, and logic (Q6150976) (← links)
- Automorphism groups of Cayley graphs generated by general transposition sets (Q6614182) (← links)
- On the diameters of friends-and-strangers graphs (Q6615519) (← links)
