An improved block-interchange algorithm

DOI10.1016/0196-6774(87)90031-9MaRDI QIDQ3794190zbMATH OpenOpenAlexFDO

Authors John L. Mohammed, Carlos Subi

Publication date 1987

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

Full work available at URL https://doi.org/10.1016/0196-6774(87)90031-9

zbMATH Keywords

algorithmblock-interchange permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumerative combinatorics (05A99)

Recommendations

• Sorting permutations by block-interchanges
• An improved algorithm for sorting by block-interchanges based on permutation groups
• Theory and Applications of Models of Computation
• Faster algorithms for sorting by transpositions and sorting by block interchanges
• Approximation algorithms for sorting permutations by extreme block-interchanges

Cited in

(12)

• Opportunity-based block replacement
• Approximation algorithms for sorting permutations by extreme block-interchanges
• scientific article; zbMATH DE number 2086238 (Why is no real title available?)
• Data Exchange and Permutation Length
• Faster algorithms for sorting by transpositions and sorting by block interchanges
• An efficient algorithm for one-sided block ordering problem with block-interchange distance
• Theory and Applications of Models of Computation
• On the cost of interchange rearrangement in strings
• Sorting permutations by block-interchanges
• An efficient algorithm for one-sided block ordering problem under block-interchange distance
• The average number of block interchanges needed to sort a permutation and a recent result of Stanley
• An improved algorithm for sorting by block-interchanges based on permutation groups

This page was built for publication: An improved block-interchange algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3794190)