Posets with seven linear extensions sortable by three comparisons

DOI10.1016/j.ipl.2011.01.004zbMath1260.68287OpenAlexW2031824092MaRDI QIDQ1944901

Shigeki Iwata, Satoshi Hanamura

Publication date: 28 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.01.004

zbMATH Keywords

comparisonsortingcombinatorial problemsposetslinear extension

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07)

Cites Work

• The Ford-Johnson algorithm still unbeaten for less than 47 elements
• Counting linear extensions
• Linear probing and graphs
• New results in minimum-comparison sorting
• Balancing poset extensions
• A Tournament Problem

This page was built for publication: Posets with seven linear extensions sortable by three comparisons