An improved algorithm for the jump number problem

DOI10.1016/S0020-0190(00)00172-1MaRDI QIDQ1603444zbMATH OpenFDO

Authors Catherine McCartin

Publication date 14 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

algorithmsordered setlinear extensionparameterized algorithmjump number

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 764417
• The jump number problem: exact and parameterized
• A refined analysis on the jump number problem of interval orders
• An optimal algorithm to find the jump number of partially ordered sets
• Tackling the jump number of interval orders

Cites work

• scientific article; zbMATH DE number 1323192 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• A decomposition theorem for partially ordered sets
• An algorithm for solving the jump number problem
• Minimizing Setups for Cycle-Free Ordered Sets
• Minimizing setups in ordered sets of fixed width
• Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II
• NP-completeness properties about linear extensions
• On some new types of greedy chains and greedy linear extensions of partially ordered sets
• On the size of jump-critical ordered sets
• Optimal Linear Extensions by Interchanging Chains

Cited in

(4)

• scientific article; zbMATH DE number 764417 (Why is no real title available?)
• An improved exact algorithm for the domatic number problem
• scientific article; zbMATH DE number 3948306 (Why is no real title available?)
• FPT Suspects and Tough Customers: Open Problems of Downey and Fellows

This page was built for publication: An improved algorithm for the jump number problem

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