Pages that link to "Item:Q1104949"
From MaRDI portal
The following pages link to Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II (Q1104949):
Displaying 10 items.
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach (Q1057887) (← links)
- Greedy linear extensions to minimize jumps (Q1061150) (← links)
- On minimizing the jump number for interval orders (Q1111581) (← links)
- An algorithm for solving the jump number problem (Q1113927) (← links)
- On minimizing jumps for ordered sets (Q1177708) (← links)
- An improved algorithm for the jump number problem (Q1603444) (← links)
- Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
- On some new types of greedy chains and greedy linear extensions of partially ordered sets (Q1894377) (← links)
- The jump number problem on interval orders: A 3/2 approximation algorithm (Q1898347) (← links)
- The arboreal jump number of an order (Q1943701) (← links)