Pages that link to "Item:Q1177708"
From MaRDI portal
The following pages link to On minimizing jumps for ordered sets (Q1177708):
Displaying 14 items.
- Minimizing the sum cost in linear extensions of a poset (Q630194) (← links)
- Minimizing setups in ordered sets of fixed width (Q762183) (← links)
- On the size of jump-critical ordered sets (Q802585) (← links)
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach (Q1057887) (← links)
- On finding the jump number of a partial order by substitution decomposition (Q1092072) (← links)
- The jump number of Z-free ordered sets (Q1183946) (← links)
- Maximum and minimum jump number of posets from matrices (Q1194526) (← links)
- On the poset of all posets on \(n\) elements (Q1326745) (← links)
- An optimal algorithm to find the jump number of partially ordered sets (Q1366304) (← links)
- The arboreal jump number of an order (Q1943701) (← links)
- Jumps of Orderings (Q3484823) (← links)
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)
- Bounds for the jump number of partially ordered sets (Q3976789) (← links)
- Jumps of Hemimaximal Sets (Q3982858) (← links)
