An improved algorithm for the jump number problem
type: Item
instance of: scholarly article
title: An improved algorithm for the jump number problem
zbMATH Open document ID: 1013.68287
DOI: 10.1016/S0020-0190(00)00172-1
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1767327
zbMATH Keywords: parameterized algorithm
zbMATH Keywords: ordered set
zbMATH Keywords: jump number
zbMATH Keywords: linear extension
zbMATH Keywords: algorithms
author: Catherine McCartin
MaRDI profile type: Publication
cites work: Minimizing setups in ordered sets of fixed width
cites work: A decomposition theorem for partially ordered sets
cites work: Q4393480
cites work: Minimizing Setups for Cycle-Free Ordered Sets
cites work: On the size of jump-critical ordered sets
cites work: NP-completeness properties about linear extensions
cites work: Optimal Linear Extensions by Interchanging Chains
cites work: Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II
cites work: On some new types of greedy chains and greedy linear extensions of partially ordered sets
cites work: An algorithm for solving the jump number problem
cites work: Q4255109
description: scientific article; zbMATH DE number 1767327