Average properties of two-dimensional partial orders

DOI10.1002/NET.3230210502MaRDI QIDQ3351401zbMATH OpenOpenAlexFDO

Authors

Publication date 1991

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230210502

zbMATH Keywords

complexity of combinatorial algorithmsnonpolynomial expected time and storage complexitynumber of upsets in randomly generated two-dimensional partial ordersprecedence constrained scheduling

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On the Complexity of Partial Order Productions
• scientific article; zbMATH DE number 512933
• scientific article; zbMATH DE number 4041286
• scientific article; zbMATH DE number 1555930
• scientific article; zbMATH DE number 4010574

Cited in

(2)

• On estimating the number of order ideals in partial orders, with some applications
• scientific article; zbMATH DE number 1555930 (Why is no real title available?)

This page was built for publication: Average properties of two-dimensional partial orders

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