Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:appearsIn |
gptkb:Karp's_21_NP-complete_problems
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:field |
theoretical computer science
combinatorics |
| gptkbp:generalizes |
gptkb:3-dimensional_matching
|
| https://www.w3.org/2000/01/rdf-schema#label |
k-dimensional matching
|
| gptkbp:input |
k-uniform hypergraph
|
| gptkbp:introducedIn |
1972
|
| gptkbp:output |
set of disjoint edges covering all vertices
|
| gptkbp:relatedTo |
gptkb:hypergraph
gptkb:set_packing_problem NP-complete problem |
| gptkbp:studiedBy |
gptkb:Richard_M._Karp
|
| gptkbp:bfsParent |
gptkb:3-Dimensional_Matching
|
| gptkbp:bfsLayer |
7
|