Matches in DBpedia 2014 for { <http://dbpedia.org/resource/3-dimensional_matching> ?p ?o. }
Showing items 1 to 18 of
18
with 100 items per page.
- 3-dimensional_matching abstract "In the mathematical discipline of graph theory, a 3-dimensional matching is a generalization of bipartite matching (a.k.a. 2-dimensional matching) to 3-uniform hypergraphs. Finding a largest 3-dimensional matching is a well-known NP-hard problem in computational complexity theory.".
- 3-dimensional_matching thumbnail 3-dimensional-matching.svg?width=300.
- 3-dimensional_matching wikiPageExternalLink node143.html.
- 3-dimensional_matching wikiPageID "22261908".
- 3-dimensional_matching wikiPageRevisionID "450554506".
- 3-dimensional_matching hasPhotoCollection 3-dimensional_matching.
- 3-dimensional_matching subject Category:Combinatorics.
- 3-dimensional_matching subject Category:Matching.
- 3-dimensional_matching subject Category:NP-complete_problems.
- 3-dimensional_matching comment "In the mathematical discipline of graph theory, a 3-dimensional matching is a generalization of bipartite matching (a.k.a. 2-dimensional matching) to 3-uniform hypergraphs. Finding a largest 3-dimensional matching is a well-known NP-hard problem in computational complexity theory.".
- 3-dimensional_matching label "3-dimensional matching".
- 3-dimensional_matching label "三维匹配问题".
- 3-dimensional_matching sameAs m.05q79w5.
- 3-dimensional_matching sameAs Q10866593.
- 3-dimensional_matching sameAs Q10866593.
- 3-dimensional_matching wasDerivedFrom 3-dimensional_matching?oldid=450554506.
- 3-dimensional_matching depiction 3-dimensional-matching.svg.
- 3-dimensional_matching isPrimaryTopicOf 3-dimensional_matching.