Pages that link to "Item:Q1087566"
From MaRDI portal
The following pages link to Constructing greedy linear extensions by interchanging chains (Q1087566):
Displaying 13 items.
- Greedy linear extensions to minimize jumps (Q1061150) (← links)
- NP-completeness results concerning greedy and super greedy linear extensions (Q1087567) (← links)
- Greedy posets for the bump-minimizing problem (Q1097902) (← links)
- Representing an ordered set as the intersection of super greedy linear extensions (Q1104948) (← links)
- On minimizing the jump number for interval orders (Q1111581) (← links)
- Minimizing bumps for posets of width two (Q1114719) (← links)
- On minimizing jumps for ordered sets (Q1177708) (← links)
- The jump number of Z-free ordered sets (Q1183946) (← links)
- On the poset of all posets on \(n\) elements (Q1326745) (← links)
- Greedy linear extensions with constraints (Q1821122) (← links)
- Obituary: Ivan Rival (Q1826506) (← links)
- On some new types of greedy chains and greedy linear extensions of partially ordered sets (Q1894377) (← links)
- Greedy balanced pairs in \(N\)-free ordered sets (Q2217505) (← links)