scientific article; zbMATH DE number 4027523

From MaRDI portal
Publication:3768941





[For the entire collection see Zbl 0615.00012.] This paper regards a particular class of partial orders and presents a polynomial time algorithm to compute Z(P) for partially ordered sets P of bounded width K.











This page was built for publication:

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