Sorting a bridge hand
From MaRDI portal
Publication:5951942
DOI10.1016/S0012-365X(01)00150-9zbMath0990.05145MaRDI QIDQ5951942
No author found.
Publication date: 22 April 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Cayley graph; polynomial time algorithm; permutation; transpositions; bridge hand; bridge player; optimal sorting
Related Items
Statistical and Combinatorial Aspects of Comparative Genomics*, APPROXIMATE BLOCK SORTING, A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves, Bounding prefix transposition distance for strings and permutations, Structural properties and tractability results for linear synteny, An approximation algorithm for sorting by reversals and transpositions, Short proofs for cut-and-paste sorting of permutations, A simpler and faster 1.5-approximation algorithm for sorting by transpositions, On sorting by 3-bounded transpositions, COMPUTING SIGNED PERMUTATIONS OF POLYGONS, Sorting by Transpositions Is Difficult