Pages that link to "Item:Q3674720"
From MaRDI portal
The following pages link to Optimal Linear Extensions by Interchanging Chains (Q3674720):
Displaying 47 items.
- Scheduling with few changes (Q299829) (← links)
- NP-completeness properties about linear extensions (Q581427) (← links)
- Minimizing the sum cost in linear extensions of a poset (Q630194) (← links)
- Minimizing completion time for a class of scheduling problems (Q794156) (← links)
- On the greedy dimension of a partial order (Q802583) (← links)
- On the size of jump-critical ordered sets (Q802585) (← links)
- The jump number and the lattice of maximal antichains (Q807648) (← links)
- Asymptotic enumeration of N-free partial orders (Q913831) (← links)
- A 3/2-approximation algorithm for the jump number of interval orders (Q921022) (← links)
- Jump number problem: The role of matroids (Q1057289) (← links)
- Greedy linear extensions to minimize jumps (Q1061150) (← links)
- A setup heuristic for interval orders (Q1064975) (← links)
- An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
- Minimizing bumps in linear extensions of ordered sets (Q1077441) (← links)
- Interval orders without odd crowns are defect optimal (Q1079584) (← links)
- Constructing greedy linear extensions by interchanging chains (Q1087566) (← links)
- NP-completeness results concerning greedy and super greedy linear extensions (Q1087567) (← 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)
- Greedy posets for the bump-minimizing problem (Q1097902) (← links)
- Substitution and atomic extension on greedy posets (Q1104347) (← links)
- Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II (Q1104949) (← links)
- On minimizing the jump number for interval orders (Q1111581) (← links)
- An algorithm for solving the jump number problem (Q1113927) (← links)
- Minimizing bumps for posets of width two (Q1114719) (← links)
- Is there a diagram invariant? (Q1115889) (← links)
- Minimizing bumps in ordered sets by substitution decomposition (Q1122595) (← links)
- On minimizing jumps for ordered sets (Q1177708) (← links)
- The jump number of Z-free ordered sets (Q1183946) (← links)
- On a setup optimization problem for interval orders (Q1195865) (← links)
- \(N\)-free orders and minimal interval extensions (Q1207724) (← links)
- Alternating cycle-free matchings (Q1325959) (← links)
- On the poset of all posets on \(n\) elements (Q1326745) (← links)
- Parallel \(N\)-free order recognition (Q1392213) (← links)
- An improved algorithm for the jump number problem (Q1603444) (← links)
- Greedy linear extensions with constraints (Q1821122) (← links)
- Computing the dimension of N-free ordered sets is NP-complete (Q1824638) (← links)
- Obituary: Ivan Rival (Q1826506) (← links)
- On some new types of greedy chains and greedy linear extensions of partially ordered sets (Q1894377) (← links)
- Interval orders based on arbitrary ordered sets (Q1898345) (← links)
- The arboreal jump number of an order (Q1943701) (← links)
- Greedy balanced pairs in \(N\)-free ordered sets (Q2217505) (← links)
- Generating linear extensions of posets by transpositions (Q2368024) (← links)
- Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets (Q2817372) (← links)
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)
- Complementation of Branching Automata for Scattered and Countable N-Free Posets (Q4683231) (← links)
- Equational Theories of Scattered and Countable Series-Parallel Posets (Q5041243) (← links)
