A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00340778 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073598086 / rank | |||
Normal rank | |||
Latest revision as of 10:11, 30 July 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
