The jump number and the lattice of maximal antichains
From MaRDI portal
(Redirected from Publication:807648)
Recommendations
Cites work
- scientific article; zbMATH DE number 3896990 (Why is no real title available?)
- scientific article; zbMATH DE number 3922723 (Why is no real title available?)
- scientific article; zbMATH DE number 4073041 (Why is no real title available?)
- scientific article; zbMATH DE number 3697161 (Why is no real title available?)
- scientific article; zbMATH DE number 3771669 (Why is no real title available?)
- scientific article; zbMATH DE number 6157242 (Why is no real title available?)
- Algorithmic Approaches to Setup Minimization
- Interval orders without odd crowns are defect optimal
- Jump number problem: The role of matroids
- Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
- Optimal Linear Extensions by Interchanging Chains
- S-verklebte Summen von Verbänden
- Setup optimization problems with matroid structure
- The Jump Number of Dags and Posets: An Introduction
Cited in
(10)- Tackling the jump number of interval orders
- Computational aspects of the 2-dimension of partially ordered sets
- Simplicial elimination schemes, extremal lattices and maximal antichain lattices
- \(N\)-free orders and minimal interval extensions
- On the number of maximal antichains in Boolean lattices for \(n\) up to 7
- Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications
- Computing on-line the lattice of maximal antichains of posets
- The presence of lattice theory in discrete problems of mathematical social sciences. Why.
- scientific article; zbMATH DE number 96384 (Why is no real title available?)
- On-line algorithms for orders
This page was built for publication: The jump number and the lattice of maximal antichains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807648)