Sorting a bridge hand
From MaRDI portal
Publication:5951942
DOI10.1016/S0012-365X(01)00150-9zbMath0990.05145OpenAlexW2170746407MaRDI QIDQ5951942
No author found.
Publication date: 22 April 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00150-9
Cayley graphpolynomial time algorithmpermutationtranspositionsbridge handbridge playeroptimal sorting
Related Items (24)
APPROXIMATE BLOCK SORTING ⋮ Approximation algorithms for sorting by bounded singleton moves ⋮ Automorphism groups of Cayley graphs generated by block transpositions and regular Cayley maps ⋮ Sorting by shuffling methods and a queue ⋮ Structural properties and tractability results for linear synteny ⋮ An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves ⋮ Block Crossings in Storyline Visualizations ⋮ Block crossings in one-sided tanglegrams ⋮ A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves ⋮ Sorting permutations with transpositions in \(O(n^3)\) amortized time ⋮ Prefix and suffix transreversals on binary and ternary strings ⋮ Short proofs for cut-and-paste sorting of permutations ⋮ CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS ⋮ COMPUTING SIGNED PERMUTATIONS OF POLYGONS ⋮ Sorting by Transpositions Is Difficult ⋮ Sorting permutations and binary strings by length-weighted rearrangements ⋮ A simpler and faster 1.5-approximation algorithm for sorting by transpositions ⋮ Statistical and Combinatorial Aspects of Comparative Genomics* ⋮ On sorting by 3-bounded transpositions ⋮ An approximation algorithm for sorting by reversals and transpositions ⋮ Unnamed Item ⋮ Representing Permutations with Few Moves ⋮ An Audit Tool for Genome Rearrangement Algorithms ⋮ Bounding prefix transposition distance for strings and permutations
This page was built for publication: Sorting a bridge hand
