O'Reilly logo

Introduction to Lattice Theory with Computer Science Applications by Vijay K. Garg

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 14Enumeration Algorithms

14.1 Introduction

The number of ideals of a poset may be exponential in the size of the poset. We have already seen that the ideals of a poset form a distributive lattice under the c14-math-0001 relation. In this chapter, we explore different ways in which the lattice of ideals may be traversed, in order to enumerate all the ideals of a poset.

We explore the following three orders of enumeration:

  • Breadth-first search (BFS): This order of enumeration corresponds to the BFS traversal of the lattice of ideals.
  • Depth-first search (DFS): This order corresponds to the DFS traversal of the lattice of ideals.
  • Lex order: This order corresponds to the “dictionary” order.

We first illustrate the above-mentioned three orders of enumeration by means of an example. Consider the poset shown in Figure 14.1(a). Figure 14.1(b) shows the lattice of ideals corresponding to this poset. In this figure, we have used the first digit and the second digit to indicate the number of events included in the ideal from the first chain and the second chain, respectively. For example, the ideal c14-math-0002 is denoted by c14-math-0003.

Figure 14.1 (a) A computation. (b) Its lattice of consistent global states. (c) ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required