Thinh D. Nguyen
Abstract
We are given a collection $S$ of sets. We would like to find the maximum number of disjoint sets in $S$. The decision problem asks for the existence of $K$ sets that are disjoint from each other.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We are given a collection $S$ of sets. We would like to find the maximum number of disjoint sets in $S$. The decision problem asks for the existence of $K$ sets that are disjoint from each other.
Key concepts: Disjoint sets, Set (abstract data type), Combinatorics, Mathematics, Computer science, Discrete mathematics, Programming language