Pages that link to "Item:Q1057887"

The following pages link to Minimizing the jump number for partially ordered sets: A graph-theoretic approach (Q1057887):

Displaying 19 items.

• Minimizing the maximum bump cost in linear extensions of a poset (Q385489) (← links)
• A polynomially solvable case of optimal linear extension problem of a poset (Q613667) (← links)
• Minimizing setups in ordered sets of fixed width (Q762183) (← links)
• On the greedy dimension of a partial order (Q802583) (← links)
• A 3/2-approximation algorithm for the jump number of interval orders (Q921022) (← links)
• Jump number problem: The role of matroids (Q1057289) (← links)
• Minimizing bumps in linear extensions of ordered sets (Q1077441) (← links)
• On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
• A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688) (← links)
• On finding the jump number of a partial order by substitution decomposition (Q1092072) (← links)
• N-free posets as generalizations of series-parallel posets (Q1097286) (← links)
• Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II (Q1104949) (← links)
• An algorithm for solving the jump number problem (Q1113927) (← links)
• The setup polyhedron of series-parallel posets (Q1372744) (← links)
• Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
• The arboreal jump number of an order (Q1943701) (← links)
• Greedy balanced pairs in \(N\)-free ordered sets (Q2217505) (← links)
• Linear extensions of N-free orders. (Q2351714) (← links)
• Fast Detection of Stable and Count Predicates in Parallel Computations (Q3300821) (← links)