The Jump Number of Dags and Posets: An Introduction
From MaRDI portal
Publication:3889080
DOI10.1016/S0167-5060(08)70060-8zbMath0445.05048OpenAlexW1532699273MaRDI QIDQ3889080
Publication date: 1980
Published in: Combinatorics 79 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70060-8
Partial orders, general (06A06) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Operations research and management science (90B99) Directed graphs (digraphs), tournaments (05C20) Total orders (06A05)
Related Items (27)
Alternating cycle-free matchings ⋮ On the poset of all posets on \(n\) elements ⋮ Algorithmic characterizations of interval orderd hypergraphs and applications ⋮ On some complexity properties of N-free posets and posets with bounded decomposition diameter ⋮ Generating linear extensions of posets by transpositions ⋮ A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders ⋮ On finding the jump number of a partial order by substitution decomposition ⋮ N-free posets as generalizations of series-parallel posets ⋮ Fast Detection of Stable and Count Predicates in Parallel Computations ⋮ Minimizing the sum cost in linear extensions of a poset ⋮ Optimal Linear Extensions by Interchanging Chains ⋮ Greedy balanced pairs in \(N\)-free ordered sets ⋮ Minimizing Setups for Cycle-Free Ordered Sets ⋮ Cross-series-parallel digraphs ⋮ Maximum and minimum jump number of posets from matrices ⋮ Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets ⋮ Scheduling tasks on a flexible manufacturing machine to minimize tool change delays ⋮ Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results ⋮ On the Jump Number of Lexicographic Sums of Ordered Sets ⋮ Preemptive scheduling and antichain polyhedra ⋮ Minimizing Setups for Ordered Sets: A Linear Algebraic Approach ⋮ Jump number of dags having Dilworth number 2 ⋮ Jump number problem: The role of matroids ⋮ Minimizing the jump number for partially ordered sets: A graph-theoretic approach ⋮ On the size of jump-critical ordered sets ⋮ The jump number and the lattice of maximal antichains ⋮ An algorithm for minimizing setups in precedence constrained scheduling
This page was built for publication: The Jump Number of Dags and Posets: An Introduction
