Skip to Content
Introduction to Lattice Theory with Computer Science Applications
book

Introduction to Lattice Theory with Computer Science Applications

by Vijay K. Garg
May 2015
Intermediate to advanced
272 pages
6h 2m
English
Wiley
Content preview from Introduction to Lattice Theory with Computer Science Applications

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) ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

AirBnbBlueOriginElectronic ArtsHomeDepotNasdaqRakutenTata Consultancy Services

QuotationMarkO’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
QuotationMarkI wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
QuotationMarkI’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
QuotationMarkI'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Mark W.
Embedded Software Engineer

You might also like

A Course in Mathematical Cryptography

A Course in Mathematical Cryptography

Gilbert Baumslag, Benjamin Fine, Martin Kreuzer, Gerhard Rosenberger

Publisher Resources

ISBN: 9781118914373Purchase book