An Algorithm for the Determination of the Variance of a Partially Ordered Set

DOI10.1006/JAGM.1995.1046MaRDI QIDQ4857541zbMATH OpenOpenAlexFDO

Authors Konrad Engel

Publication date 11 April 1996

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1995.1046

zbMATH Keywords

optimal representationMax-Flow-Algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07) Parallel algorithms in computer science (68W10)

Recommendations

• Optimal representations of partially ordered sets and a limit Sperner theorem
• Publication:4729840
• Algorithms over partially ordered sets
• Efficiently counting representations of finite posets
• scientific article; zbMATH DE number 1766721

Cited in

(9)

• scientific article; zbMATH DE number 1766721 (Why is no real title available?)
• Optimal representations of partially ordered sets and a limit Sperner theorem
• Time-dependent operator matrices and inhomogeneous Cauchy problems
• scientific article; zbMATH DE number 4053690 (Why is no real title available?)
• scientific article; zbMATH DE number 4114703 (Why is no real title available?)
• scientific article; zbMATH DE number 4035884 (Why is no real title available?)
• Regulating functions on partially ordered sets
• Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized
• Efficiently counting representations of finite posets

This page was built for publication: An Algorithm for the Determination of the Variance of a Partially Ordered Set

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