Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II
From MaRDI portal
(Redirected from Publication:1104949)
Recommendations
- An algorithm for solving the jump number problem
- On some new types of greedy chains and greedy linear extensions of partially ordered sets
- scientific article; zbMATH DE number 764417
- scientific article; zbMATH DE number 3896963
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
Cites work
- scientific article; zbMATH DE number 3896963 (Why is no real title available?)
- Minimizing setups in ordered sets of fixed width
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- On some new types of greedy chains and greedy linear extensions of partially ordered sets
- On the greedy dimension of a partial order
- Optimal Linear Extensions by Interchanging Chains
Cited in
(12)- Minimizing the jump number for partially ordered sets: A graph-theoretic approach
- Greedy linear extensions to minimize jumps
- On minimizing the jump number for interval orders
- An algorithm for solving the jump number problem
- On minimizing jumps for ordered sets
- An improved algorithm for the jump number problem
- Jump number maximization for proper interval graphs and series-parallel graphs
- On some new types of greedy chains and greedy linear extensions of partially ordered sets
- The jump number problem on interval orders: A 3/2 approximation algorithm
- The arboreal jump number of an order
- scientific article; zbMATH DE number 3896963 (Why is no real title available?)
- scientific article; zbMATH DE number 822739 (Why is no real title available?)
This page was built for publication: Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104949)