3-Dimensional Matching

GPTKB entity

Statements (22)
Predicate Object
gptkbp:instanceOf theoretical computer science
NP-complete problem
gptkbp:complexity NP-complete
gptkbp:definedIn tripartite hypergraph
gptkbp:field theoretical computer science
gptkbp:generalizes bipartite matching
gptkbp:hasVariant gptkb:k-dimensional_matching
https://www.w3.org/2000/01/rdf-schema#label 3-Dimensional Matching
gptkbp:input set T of triples (X × Y × Z)
set X
set Y
set Z
gptkbp:introduced gptkb:Richard_M._Karp
gptkbp:introducedIn gptkb:Karp's_21_NP-complete_problems
1972
gptkbp:relatedTo gptkb:3-SAT
gptkb:matching_(graph_theory)
gptkbp:type Does there exist a matching M ⊆ T such that every element of X, Y, Z appears in exactly one triple in M?
gptkbp:usedIn complexity reductions
gptkbp:bfsParent gptkb:Karp's_21_NP-complete_problems
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972)
gptkbp:bfsLayer 6