Finding maximal independent elements of products of partial orders (the case of chains)

DOI10.1007/s10598-019-09429-yzbMath1485.68168OpenAlexW2910791402MaRDI QIDQ2319829

P. A. Prokofyev, E. V. Dyukova, G. O. Maslyakov

Publication date: 20 August 2019

Published in: Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10598-019-09429-y

zbMATH Keywords

asymptotically optimal algorithmdualization over products of partial ordersirreducible covering of a Boolean matrixmaximal independent elementordered covering of an integer matrix

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Boolean functions (06E30) Total orders (06A05) Boolean and Hadamard matrices (15B34)

Related Items (1)

On the logical analysis of partially ordered data in the supervised classification problem

Cites Work

• Unnamed Item
• Unnamed Item
• On generating all maximal independent sets
• Asymptotically optimal dualization algorithms
• Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Algorithms for Dualization over Products of Partially Ordered Sets

This page was built for publication: Finding maximal independent elements of products of partial orders (the case of chains)