Efficient realizations of closure systems
From MaRDI portal
Recommendations
Cites work
- A note on voting
- A property of the lattice of equational theories
- A Tverberg-type generalization of the Helly number of a convexity space
- Algebraic Codes on Lines, Planes, and Curves
- Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers
- Complexity analysis of P₃-convexity problems on bounded-degree and planar graphs
- Convex excess in partial cubes
- Convex, acyclic, and free sets of an oriented matroid
- Convexities related to path properties on graphs
- Der Satz von Radon in konvexen Produktstrukturen. II
- Geodetic number versus hull number in P₃-convexity
- Graphs with a minimal number of convex sets
- Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
- scientific article; zbMATH DE number 439012 (Why is no real title available?)
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 3757213 (Why is no real title available?)
- scientific article; zbMATH DE number 718866 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3329973 (Why is no real title available?)
- scientific article; zbMATH DE number 3421490 (Why is no real title available?)
- scientific article; zbMATH DE number 3191288 (Why is no real title available?)
- scientific article; zbMATH DE number 3198885 (Why is no real title available?)
- scientific article; zbMATH DE number 3068278 (Why is no real title available?)
- scientific article; zbMATH DE number 3082618 (Why is no real title available?)
- Lattice Theory: Foundation
- Medical surveillance, frequent sets, and closure operations
- On subalgebra lattices of universal algebras
- On the Carathéodory number of interval and graph convexities
- Open packing, total domination, and the P₃-Radon number
- Partition numbers for trees and ordered sets
- Partitioning a graph into convex sets
- Representations of Lattices by Sets
- Subalgebra systems of powers of partial universal algebras
- The Carathéodory number of the \(P_3\) convexity of chordal graphs
- The structure of finite algebras
- Three generalisations of lattice distributivity: An FCA perspective
- Unary polynomials in algebras. I
This page was built for publication: Efficient realizations of closure systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6193266)