The jump number of Z-free ordered sets
From MaRDI portal
Publication:1183946
DOI10.1007/BF00383447zbMath0759.06002MaRDI QIDQ1183946
Publication date: 28 June 1992
Published in: Order (Search for Journal in Brave)
polynomial-time algorithmjump numberoptimal linear extensionjump problem for \(Z\)-free ordered setsorder-duals
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07)
Related Items (1)
Cites Work
- Unnamed Item
- Antichain cutsets
- Minimizing setups in ordered sets of fixed width
- Jump number of dags having Dilworth number 2
- A setup heuristic for interval orders
- Constructing greedy linear extensions by interchanging chains
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
- On minimizing jumps for ordered sets
- On a setup optimization problem for interval orders
- Optimal Linear Extensions by Interchanging Chains
- Minimizing Setups for Cycle-Free Ordered Sets
This page was built for publication: The jump number of Z-free ordered sets