The arboreal jump number of an order
type: Item
instance of: scholarly article
title: The arboreal jump number of an order
zbMATH Open document ID: 1296.06002
author: A. Figueiredo
author: Sulamita Klein
author: M. A. Habib
author: Jayme L. Szwarcfiter
published in: Order
publication date: 2013-03-20T00:00:00Z
Mathematics Subject Classification ID: 06A07
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6147393
zbMATH Keywords: arboreal jump number
zbMATH Keywords: order extensions
zbMATH Keywords: greedy chain decompositions
zbMATH Keywords: partially ordered sets
zbMATH Keywords: arboreal extension
MaRDI profile type: Publication
full work available at URL: s11083-012-9246-4
OpenAlex ID: W2057779442
cites work: Computing the jump number on semi-orders is polynomial
cites work: An optimal algorithm to find the jump number of partially ordered sets
cites work: NP-completeness properties about linear extensions
cites work: Q4200070
cites work: Minimizing setups in ordered sets of fixed width
cites work: Minimizing Setups for Cycle-Free Ordered Sets
cites work: A setup heuristic for interval orders
cites work: A 3/2-approximation algorithm for the jump number of interval orders
cites work: Q3976789
cites work: Q5184948
cites work: N-free posets as generalizations of series-parallel posets
cites work: On some complexity properties of N-free posets and posets with bounded decomposition diameter
cites work: Invariants of finite comparability graphs
cites work: Tackling the jump number of interval orders
cites work: Optimal Linear Extensions by Interchanging Chains
cites work: On finding the jump number of a partial order by substitution decomposition
cites work: Minimizing the jump number for partially ordered sets: A graph-theoretic approach
cites work: Q3676161
cites work: An algorithm for solving the jump number problem
cites work: The jump number problem on interval orders: A 3/2 approximation algorithm
DOI: 10.1007/S11083-012-9246-4
description: scientific article; zbMATH DE number 6147393