Efficient polynomial algorithms for distributive lattices (Q810071)

From MaRDI portal
Revision as of 23:02, 5 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
Efficient polynomial algorithms for distributive lattices
scientific article

    Statements

    Efficient polynomial algorithms for distributive lattices (English)
    0 references
    0 references
    1991
    0 references
    0 references
    0 references
    0 references
    0 references
    breadth-first search
    0 references
    Hasse graph of a distributive lattice
    0 references
    polynomial problems
    0 references
    canonical decomposition
    0 references
    transitive closure
    0 references
    generation
    0 references
    recognition
    0 references
    orientability
    0 references
    combinatorial algorithm
    0 references