An improved algorithm for the jump number problem

DOI10.1016/S0020-0190(00)00172-1zbMATH Open1013.68287MaRDI QIDQ1603444FDOQ1603444

Catherine McCartin

Publication date: 14 July 2002

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

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

zbMATH Keywords

algorithmsordered setlinear extensionparameterized algorithmjump number

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• An improved exact algorithm for the domatic number problem
• Title not available (Why is that?)
• 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)