Introduction to Lattice Theory with Computer Science Applications

Chapter 2Representing Posets

2.1 Introduction

We now look at some possible representations for efficient queries and operations on posets. For this purpose, we first examine some of the common operations that are generally performed on posets. Given a poset , the following operations on elements are frequently performed:

1. Check if . We denote this operation by .
2. Check if covers .
3. Compute () and ().

In all such representations, we first need to number the elements of the poset. A useful way ...