Lesson plan
Set splitting problem
. The vertices make up the set S, and the edges make up the family of subsets F. The vertices are colored such that every edge has at least one vertex of each color (in this case, red and green). In computational complexity theory, the set splitting problem is the following decision problem: given a family F of subsets of a finite set S, decide whether there exists a partition of S into two subsets S 1 , S 2 such that all elements of F are split by this partition, i.e., none of the elements of F is completely in S 1 or S 2 . Set Splitting is one of Garey & Johnson's classical NP-complete problems. The problem is sometimes called hypergraph 2-colorability.
Article summary
. The vertices make up the set S, and the edges make up the family of subsets F. The vertices are colored such that every edge has at least one vertex of each color (in this case, red and green). In computational complexity theory, the set splitting problem is the following decision problem: given a family F of subsets of a finite set S, decide whether there exists a partition of S into two subsets S 1 , S 2 such that all elements of F are split by this partition, i.e., none of the elements of F is completely in S 1 or S 2 . Set Splitting is one of Garey & Johnson's classical NP-complete problems. The problem is sometimes called hypergraph 2-colorability.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.