Posets with seven linear extensions sortable by three comparisons
type: Item
instance of: scholarly article
title: Posets with seven linear extensions sortable by three comparisons
zbMATH Open document ID: 1260.68287
author: Satoshi Hanamura
author: Shigeki Iwata
published in: Information Processing Letters
publication date: 2013-03-28T00:00:00Z
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 06A07
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 6149187
zbMATH Keywords: combinatorial problems
zbMATH Keywords: linear extension
zbMATH Keywords: sorting
zbMATH Keywords: comparison
zbMATH Keywords: posets
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.01.004
OpenAlex ID: W2031824092
cites work: Counting linear extensions
cites work: A Tournament Problem
cites work: Balancing poset extensions
cites work: Linear probing and graphs
cites work: New results in minimum-comparison sorting
cites work: The Ford-Johnson algorithm still unbeaten for less than 47 elements
DOI: 10.1016/J.IPL.2011.01.004
description: scientific article; zbMATH DE number 6149187