A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688)

From MaRDI portal
Revision as of 18:21, 12 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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

    Identifiers