A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:11, 31 January 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
