Searching for "On partitions of a partially ordered set." – sorted by Relevance.
-
unknown title
- partition of a partially ordered set into chains and antichains, and a minimum partition of a sequence
- Add To MetaCart
-
Chaining Patterns
- of the partially ordered set P as a condensed representation for P. There exists a chain partition for any
- Cited by 4 (4 self) – Add To MetaCart
-
Partitioning a weighted partial order
- of partitioning a weighted partially ordered set into chains of bounded size. We established its complexity
- Cited by 1 (0 self) – Add To MetaCart
-
Event-Based Execution Architectures for Dynamic Software Systems
- points. A consistent cut partitions a partially ordered set into a before and after part. If an event
- Cited by 11 (1 self) – Add To MetaCart
-
On minimum kmodal partitions of permutations
- ] give a factor 1.71 approximation algorithm for finding a minimum partition of a partially ordered set
- Cited by 1 (1 self) – Add To MetaCart
-
Pushing Extrema Aggregates to Optimize Logic Queries
- . We assume that P is partitioned into a partially ordered set of sub-programs which are computed
- Cited by 2 (0 self) – Add To MetaCart

