Subject
General Computer Science,Theoretical Computer Science
Reference28 articles.
1. A group-theoretic model for symmetric interconnection networks;Akers;IEEE Trans. Comput.,1989
2. Sorting by transpositions is difficult;Bulteau;SIAM J. Discrete Math.,2012
3. A new and faster method of sorting by transpositions;Benoît-Gagné,2007
4. Sorting by transpositions;Bafna;SIAM J. Discrete Math.,1998
5. On Transforming Sequences;Chitturi,2007
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Analysis of Algorithm D* on N-Broom;2023 4th IEEE Global Conference for Advancement in Technology (GCAT);2023-10-06
2. Super oriented cycles in permutations;Computers in Biology and Medicine;2023-10
3. An Efficient Quasi Comparison-free Bidirectional Architecture for Sorting Algorithm;2022 IEEE 3rd Global Conference for Advancement in Technology (GCAT);2022-10-07
4. Optimal Algorithms for Sorting Permutations with Brooms;Algorithms;2022-06-21
5. An Upper Bound for Sorting $$R_n$$ with LRE;Communications in Computer and Information Science;2021