Pages that link to "Item:Q1090688"
From MaRDI portal
The following pages link to A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688):
Displaying 13 items.
- Minimizing the sum cost in linear extensions of a poset (Q630194) (← links)
- Visibility graphs of towers (Q676570) (← links)
- A 3/2-approximation algorithm for the jump number of interval orders (Q921022) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- On minimizing jumps for ordered sets (Q1177708) (← links)
- The jump number of Z-free ordered sets (Q1183946) (← links)
- Maximum and minimum jump number of posets from matrices (Q1194526) (← links)
- On a setup optimization problem for interval orders (Q1195865) (← links)
- Line directionality of orders (Q1311417) (← links)
- Alternating cycle-free matchings (Q1325959) (← links)
- On edge perfectness and classes of bipartite graphs (Q1910576) (← links)
- Independent sets and hitting sets of bicolored rectangular families (Q2032357) (← links)
- Jump Number of Two-Directional Orthogonal Ray Graphs (Q3009778) (← links)
