scientific article; zbMATH DE number 19350

MaRDI QIDQ3976789zbMATH OpenFDO

Authors Stefan Felsner

Publication date 26 June 1992

zbMATH Keywords

jump numberlinear extensionlower boundsmaximal chains

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorial optimization (90C27)

Recommendations

• An optimal algorithm to find the jump number of partially ordered sets
• A 3/2-approximation algorithm for the jump number of interval orders
• Greedy linear extensions to minimize jumps
• On minimizing jumps for ordered sets
• scientific article; zbMATH DE number 764417

Cited in

(15)

• Greedy linear extensions to minimize jumps
• On finding the jump number of a partial order by substitution decomposition
• On minimizing jumps for ordered sets
• An optimal algorithm to find the jump number of partially ordered sets
• The arboreal jump number of an order
• Estimates for F-jumping numbers and bounds for Hartshorne-Speiser-Lyubeznik numbers
• Jumps of Hemimaximal Sets
• scientific article; zbMATH DE number 1254201 (Why is no real title available?)
• scientific article; zbMATH DE number 1558370 (Why is no real title available?)
• NP-completeness properties about linear extensions
• The jump number of suborders of the power set order
• On the size of jump-critical ordered sets
• The jump number and the lattice of maximal antichains
• Chain dominated orders
• A 3/2-approximation algorithm for the jump number of interval orders

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976789)