Efficient polynomial algorithms for distributive lattices (Q810071): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:05, 30 January 2024
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
1991
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
