Sorting by means of swappings

DOI10.1016/0012-365X(74)90080-6zbMath0288.05010MaRDI QIDQ1846423

No author found.

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Enumerative combinatorics (05A99) Permutation groups (20B99)

Related Items (7)

Unnamed Item ⋮ Sorting networks: to the end and back again ⋮ Bounds on the size of test sets for sorting and related networks ⋮ Multitriangulations, pseudotriangulations and primitive sorting networks ⋮ Fun-Sort -- or the chaos of unordered binary search ⋮ Computing pseudotriangulations via branched coverings ⋮ Computational geometric aspects of rhythm, melody, and voice-leading

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Sorting by means of swappings