Chain dominated orders
From MaRDI portal
The authors investigate the structural properties of chain dominated orders that are finite partial orders and have a chain such that every element of the order either belongs to this chain or has all its covers in this chain. They show that such orders are exactly the orders being both interval orders and truncated lattices. They prove that their jump number is polynomially tractable and that their dimension is unbounded. They also show that every order admits a visibility model having such an order as host.
Recommendations
Cites work
- A bound on the dimension of interval orders
- A linear-time recognition algorithm for interval dags
- Description of some relations on the set of real-line intervals
- scientific article; zbMATH DE number 3877239 (Why is no real title available?)
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 1862431 (Why is no real title available?)
- scientific article; zbMATH DE number 758787 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- scientific article; zbMATH DE number 3318595 (Why is no real title available?)
- scientific article; zbMATH DE number 3375519 (Why is no real title available?)
- Intransitive indifference with unequal indifference intervals
- Partial orders and their convex subsets
- Partial orders on weak orders convex subsets
- Scheduling Interval-Ordered Tasks
- Split orders
- Tackling the jump number of interval orders
- Tree-visibility orders
Cited in
(3)
This page was built for publication: Chain dominated orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862975)