Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II

DOI10.1016/0012-365X(87)90017-3zbMath0648.06002OpenAlexW2002972843MaRDI QIDQ1104949

Maciej M. Sysło

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90017-3

zbMATH Keywords

jump number problemN-free posetsarc diagrams of posetsgreedy chains

Mathematics Subject Classification ID

Partial orders, general (06A06) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

On some new types of greedy chains and greedy linear extensions of partially ordered sets ⋮ The jump number problem on interval orders: A 3/2 approximation algorithm ⋮ An algorithm for solving the jump number problem ⋮ An improved algorithm for the jump number problem

Cites Work

• Unnamed Item
• Minimizing setups in ordered sets of fixed width
• On the greedy dimension of a partial order
• Minimizing the jump number for partially ordered sets: A graph-theoretic approach
• On some complexity properties of N-free posets and posets with bounded decomposition diameter
• On some new types of greedy chains and greedy linear extensions of partially ordered sets
• Optimal Linear Extensions by Interchanging Chains

This page was built for publication: Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II