A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders |
scientific article; zbMATH DE number 4008455
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders |
scientific article; zbMATH DE number 4008455 |
Statements
A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (English)
0 references
1987
0 references
The authors present a linear algorithm for solving the jump number problem in 2-dimensional bipartite posets.
0 references
linear algorithm
0 references
jump number problem
0 references
2-dimensional bipartite posets
0 references
