Jump number problem: The role of matroids
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 952655
- The joints problem for matroids
- scientific article; zbMATH DE number 3896963
- Matroid Parity and Jump Systems: A Solution to a Conjecture of Recski
- The jump number problem: exact and parameterized
- Maximum and minimum jump number of posets from matrices
- On the number of matroids
- On the number of matroids
- On the Complexity of Some Enumeration Problems for Matroids
- scientific article; zbMATH DE number 3370358
Cites work
- scientific article; zbMATH DE number 3860892 (Why is no real title available?)
- scientific article; zbMATH DE number 3641455 (Why is no real title available?)
- Algorithmic Approaches to Setup Minimization
- Minimizing Setups for Cycle-Free Ordered Sets
- Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
- Minimizing completion time for a class of scheduling problems
- Minimizing setups in ordered sets of fixed width
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- On the size of jump-critical ordered sets
- Optimal Linear Extensions by Interchanging Chains
- The Jump Number of Dags and Posets: An Introduction
Cited in
(4)
This page was built for publication: Jump number problem: The role of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1057289)