On minimizing jumps for ordered sets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3641455 (Why is no real title available?)
- A 3/2-approximation algorithm for the jump number of interval orders
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
- Constructing greedy linear extensions by interchanging chains
- Jump number of dags having Dilworth number 2
- Minimizing Setups for Cycle-Free Ordered Sets
- Minimizing setups in ordered sets of fixed width
- NP-completeness properties about linear extensions
- On a setup optimization problem for interval orders
- Optimal Linear Extensions by Interchanging Chains
Cited in
(13)- Maximum and minimum jump number of posets from matrices
- On the poset of all posets on \(n\) elements
- Minimizing setups in ordered sets of fixed width
- scientific article; zbMATH DE number 4019120 (Why is no real title available?)
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- Minimizing the sum cost in linear extensions of a poset
- Jumps of Orderings
- On the size of jump-critical ordered sets
- Jumps of Hemimaximal Sets
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
- The arboreal jump number of an order
- On finding the jump number of a partial order by substitution decomposition
- The jump number of Z-free ordered sets
This page was built for publication: On minimizing jumps for ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177708)
