Efficient polynomial algorithms for distributive lattices (Q810071): 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.1016/0166-218x(91)90022-o / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092352805 / rank | |||
Normal rank | |||
Latest revision as of 08:35, 30 July 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
0 references
