Sorting on graphs by adjacent swaps using permutation groups
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Recommendations
Cites work
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 3689291 (Why is no real title available?)
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3569818 (Why is no real title available?)
- scientific article; zbMATH DE number 1054728 (Why is no real title available?)
- scientific article; zbMATH DE number 1945172 (Why is no real title available?)
- scientific article; zbMATH DE number 1557065 (Why is no real title available?)
- scientific article; zbMATH DE number 7696310 (Why is no real title available?)
- A combinatorial proof of symmetry among minimal star factorizations
- A group-theoretic model for symmetric interconnection networks
- A review of metrics on permutations for search landscape analysis
- A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation
- Adjacent Swaps on Strings
- Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution
- Bounds for sorting by prefix reversal
- Circular permutations and genome shuffling
- Codes in Permutations and Error Correction for Rank Modulation
- Combinatorics of Coxeter Groups
- Combinatorics of genome rearrangements.
- Edit Distances and Factorisations of Even Permutations
- Enumeration of planar constellations
- Faster algorithms for sorting by transpositions and sorting by block interchanges
- Genome Rearrangements and Sorting by Reversals
- Group-theoretic models of the inversion process in bacterial genomes
- Groups, graphs and trees. An introduction to the geometry of infinite groups.
- How to sort by walking on a tree
- Introduction to algorithms
- Lower bounding edit distances between permutations
- Matters computational. Ideas, algorithms, source code.
- Minimal factorizations of permutations into star transpositions
- Minimal sense of direction and decision problems for Cayley graphs
- On Some Structural Properties of Star and Pancake Graphs
- On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
- On the number of reduced decompositions of elements of Coxeter groups
- On the representation of permutations as products of transpositions
- Orienting Cayley graphs generated by transposition trees
- Permutations as Products of Transpositions
- Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ary trees
- Sorting by bounded block-moves
- Sorting circular permutations by reversal.
- Sorting permutations by block-interchanges
- Spectra of Cayley graphs
- Swapping Colored Tokens on Graphs
- Swapping labeled tokens on graphs
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Task assignment in Cayley interconnection topologies
- Task swapping networks in distributed systems
- The Magma algebra system. I: The user language
- The complexity of finding minimum-length generator sequences
- The design of approximation algorithms
- The reversal median problem
- Transforming cabbage into turnip
- Tree Spanners
- Whitney numbers of the second kind for the star poset
Cited in
(9)- A five-element transformation monoid on labelled trees
- Hardness of token swapping on trees
- Improving quantum computation by optimized qubit routing
- Complexity analysis and performance of double hashing sort algorithm
- An alternative approach to the discrete Shnirelman's inequality
- On the diameters of friends-and-strangers graphs
- Finding k shortest paths in Cayley graphs of finite groups
- Reconfiguration of labeled matchings in triangular grid graphs
- Token Swapping on Trees
This page was built for publication: Sorting on graphs by adjacent swaps using permutation groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374257)
