3-dimensional matching
In the mathematical discipline of graph theory, a 3-dimensional matching is a generalization of bipartite matching (also known as 2-dimensional matching) to 3-uniform hypergraphs. Finding a largest 3-dimensional matching is a well-known NP-hard problem in computational complexity theory.
primaryTopic
3-dimensional matching
In the mathematical discipline of graph theory, a 3-dimensional matching is a generalization of bipartite matching (also known as 2-dimensional matching) to 3-uniform hypergraphs. Finding a largest 3-dimensional matching is a well-known NP-hard problem in computational complexity theory.
has abstract
In the mathematical discipline ...... mputational complexity theory.
@en
Na disciplina matemática de te ...... da Complexidade computacional.
@pt
三维匹配问题（3DM）是六个经典NP完全问题之一，是经典的“ ...... 普通的婚姻问题可以在多项式时间内解决，而3DM是NP完全的。
@zh
thumbnail
Link from a Wikipage to an external page
Wikipage page ID
22,261,908
Wikipage revision ID
716,627,279
hypernym
comment
In the mathematical discipline ...... mputational complexity theory.
@en
Na disciplina matemática de te ...... da Complexidade computacional.
@pt
三维匹配问题（3DM）是六个经典NP完全问题之一，是经典的“ ...... 普通的婚姻问题可以在多项式时间内解决，而3DM是NP完全的。
@zh
label
3-dimensional matching
@en
Acoplamento tridimensional
@pt
三维匹配问题
@zh
