| Article ID: | iaor1992630 |
| Country: | Netherlands |
| Volume: | 32 |
| Issue: | 4 |
| Start Page Number: | 31 |
| End Page Number: | 50 |
| Publication Date: | Jun 1991 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Bordat Jean-Paul |
Use is made of an original property of breadth-first search in the Hasse graph of a distributive lattice for solving some polynomial problems, such as: canonical decomposition, transitive closure, generation, recognition, and orientability. A rather efficient and combinatorial algorithm is produced for each of these problems.