A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1166490 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Nicolae Tandareanu / rank | |||
Normal rank | |||
Revision as of 08:29, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders |
scientific article |
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
