A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
type: Item
instance of: scholarly article
title: A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
zbMATH Open document ID: 0622.06002
DOI: 10.1007/BF00340778
author: George Steiner
author: Lorna Stewart
published in: Order
publication date: 1987-01-01T00:00:00Z
review text: The authors present a linear algorithm for solving the jump number problem in 2-dimensional bipartite posets.
Mathematics Subject Classification ID: 06A06
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4008455
zbMATH Keywords: linear algorithm
zbMATH Keywords: jump number problem
zbMATH Keywords: 2-dimensional bipartite posets
reviewed by: Nicolae Ţăndăreanu
MaRDI profile type: Publication
cites work: Q3679238
cites work: Q3890731
cites work: The Jump Number of Dags and Posets: An Introduction
cites work: Jump number of dags having Dilworth number 2
cites work: Q4200070
cites work: Minimizing setups in ordered sets of fixed width
cites work: Minimizing Setups for Cycle-Free Ordered Sets
cites work: Greedy linear extensions to minimize jumps
cites work: Permutation Graphs and Transitive Graphs
cites work: Q3329227
cites work: Algorithmic Approaches to Setup Minimization
cites work: Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
cites work: Optimal Linear Extensions by Interchanging Chains
cites work: Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
cites work: Minimizing the jump number for partially ordered sets: A graph-theoretic approach
full work available at URL: https://doi.org/10.1007/bf00340778
OpenAlex ID: W2073598086
description: scientific article; zbMATH DE number 4008455