Posets with seven linear extensions sortable by three comparisons

DOI10.1016/J.IPL.2011.01.004MaRDI QIDQ1944901zbMATH OpenOpenAlexFDO

Authors Satoshi Hanamura, Shigeki Iwata

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

comparisonposetssortingcombinatorial problemslinear extension

Mathematics Subject Classification ID

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

Recommendations

• Balancing poset extensions
• scientific article; zbMATH DE number 4041286
• New results in minimum-comparison sorting
• Generating Linear Extensions Fast

Cites work

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

Cited in

(1)

• Optimizing linear extensions

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

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