An improved algorithm for the jump number problem

DOI10.1016/S0020-0190(00)00172-1zbMath1013.68287MaRDI QIDQ1603444

Catherine McCartin

Publication date: 14 July 2002

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

zbMATH Keywords

algorithmsordered setjump numberlinear extensionparameterized algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (1)

FPT Suspects and Tough Customers: Open Problems of Downey and Fellows

Cites Work

• Unnamed Item
• Unnamed Item
• NP-completeness properties about linear extensions
• Minimizing setups in ordered sets of fixed width
• On the size of jump-critical ordered sets
• Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II
• An algorithm for solving the jump number problem
• On some new types of greedy chains and greedy linear extensions of partially ordered sets
• A decomposition theorem for partially ordered sets
• Optimal Linear Extensions by Interchanging Chains
• Minimizing Setups for Cycle-Free Ordered Sets

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