A polynomial time algorithm for the 2-poset cover problem

DOI10.1016/j.ipl.2021.106106OpenAlexW3128708903MaRDI QIDQ2032144

Ivy Ordanel, Proceso Fernandez, Henry N. Adorna

Publication date: 16 June 2021

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

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

zbMATH Keywords

computational complexityanalysis of algorithmslinear orderspartial orders

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Permutation statistics and linear extensions of posets
• MINING POSETS FROM LINEAR ORDERS
• The Graph of Linear Extensions Revisited

This page was built for publication: A polynomial time algorithm for the 2-poset cover problem