Algorithms over partially ordered sets

DOI10.1007/BF01933247MaRDI QIDQ5562362zbMATH OpenFDO

Authors Robert M. Baer, Ole Østerby

Publication date 1969

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01933247

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07) Semilattices (06A12) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 47694
• scientific article; zbMATH DE number 4010574
• Some optimal algorithms for decomposed partially ordered sets
• scientific article; zbMATH DE number 4200270
• Generating Linear Extensions Fast

Cites work

• A proposal for input-output conventions in ALGOL 60
• Certain homomorphisms onto chains

Cited in

(38)

• Recognition of order-preserving maps
• Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés
• Some algorithms based on the dual of Dilworth's theorem
• Some optimal algorithms for decomposed partially ordered sets
• Maximal chains of preorders
• On the poset of all posets on n elements
• A Robinson-Schensted algorithm for a class of partial orders
• On-line algorithms for orders
• Algorithms for computing lengths of chains in integral partition lattices.
• On the poset of computation rules for nonassociative calculus
• Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
• Finding maximal independent elements of products of partial orders (the case of chains)
• Similarity relations and fuzzy orderings
• A peep through the looking glass: articulation points in lattices
• scientific article; zbMATH DE number 4016967 (Why is no real title available?)
• scientific article; zbMATH DE number 3861169 (Why is no real title available?)
• scientific article; zbMATH DE number 4200270 (Why is no real title available?)
• Calcul des idéaux d'un ordonné fini
• An algorithmic approach to maximal unions of chains in a partially ordered set
• Partially ordered sets in complex networks
• scientific article; zbMATH DE number 3981229 (Why is no real title available?)
• scientific article; zbMATH DE number 4045807 (Why is no real title available?)
• scientific article; zbMATH DE number 4090768 (Why is no real title available?)
• scientific article; zbMATH DE number 47694 (Why is no real title available?)
• scientific article; zbMATH DE number 626017 (Why is no real title available?)
• A matrix analysis of carrier posets of biconnected graphs
• scientific article; zbMATH DE number 1524190 (Why is no real title available?)
• Partially ordered sets and stratification
• scientific article; zbMATH DE number 1827438 (Why is no real title available?)
• scientific article; zbMATH DE number 1880331 (Why is no real title available?)
• scientific article; zbMATH DE number 1890121 (Why is no real title available?)
• An Algorithm for the Determination of the Variance of a Partially Ordered Set
• An efficient algorithm of deriving a Hasse diagram from the reachability matrix of a partial order relation and its application to cognitive diagnosis
• Reconstruction of partial orders and list representation as random structures
• Algorithms for dualization over products of partially ordered sets
• Chain partitions of ordered sets
• Sets as anti-chains
• Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice

Describes a project that uses

Uses Software

• ALGOL 60

This page was built for publication: Algorithms over partially ordered sets

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