Minimizing Setups for Ordered Sets: A Linear Algebraic Approach

DOI10.1137/0604016zbMath0517.06004OpenAlexW1988363261MaRDI QIDQ3665161

Werner Poguntke, Gerhard Gierz

Publication date: 1983

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0604016

zbMATH Keywords

incidence matrixlinear extensioncycle-series-parallel ordered setssetup number of finite ordered set

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (16)

Interval orders without odd crowns are defect optimal ⋮ On some complexity properties of N-free posets and posets with bounded decomposition diameter ⋮ 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 ⋮ Greedy posets for the bump-minimizing problem ⋮ Substitution and atomic extension on greedy posets ⋮ Random graph orders ⋮ Optimal Linear Extensions by Interchanging Chains ⋮ Greedy balanced pairs in \(N\)-free ordered sets ⋮ Tackling the jump number of interval orders ⋮ The communication complexity of interval orders ⋮ The jump number of suborders of the power set order ⋮ Jump number problem: The role of matroids ⋮ The jump number and the lattice of maximal antichains ⋮ An algorithm for minimizing setups in precedence constrained scheduling

Cites Work

• The Jump Number of Dags and Posets: An Introduction
• Minimizing Setups for Cycle-Free Ordered Sets
• Complexity of Scheduling under Precedence Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing Setups for Ordered Sets: A Linear Algebraic Approach