Optimal Deterministic Algorithm for the Hammock(2,2)-Poset Cover Problem.
Consider the ordering of different tasks in Figure 1. Suppose a teacher gives those tasks to students and the students need to finish all of them. From the graph, there are some tasks that are dependent on other tasks. For example, Tasks 2, 3, and 4 need to be accomplished first before proceeding on...
| Other Authors: | |
|---|---|
| Format: | Analytics |
| Subjects: |