A polynomial time algorithm for the 2-poset cover problem
type: Item
instance of: scholarly article
title: A polynomial time algorithm for the 2-poset cover problem
author: Ivy Ordanel
author: Proceso L. Fernandez
author: Henry N. Adorna
published in: Information Processing Letters
publication date: 2021-06-16T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7360068
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: computational complexity
zbMATH Keywords: partial orders
zbMATH Keywords: linear orders
MaRDI profile type: Publication
full work available at URL: j.ipl.2021.106106
OpenAlex ID: W3128708903
cites work: Mining posets from linear orders.
cites work: The Graph of Linear Extensions Revisited
cites work: Permutation statistics and linear extensions of posets
DOI: 10.1016/J.IPL.2021.106106
description: scientific article; zbMATH DE number 7360068