3-dimensional matching

Known as: 3d matching, Hypergraph matching, Tripartite matching 
In the mathematical discipline of graph theory, a 3-dimensional matching is a generalization of bipartite matching (also known as 2-dimensional… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We present a (4 + ) approximation algorithm for weighted graph matching which applies in the semistreaming, sliding window, and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
  • Marek Cygan
  • IEEE 54th Annual Symposium on Foundations of…
  • 2013
One of the most natural optimization problems is the k-SET PACKING problem, where given a family of sets of size at most k one… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
We show how the implementation of conservative logic gates on flow networks suggests a way to solve 3SAT and 3-dimensional… (More)
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Graph pattern matching is commonly used in a variety of emerging applications such as social network analysis. These applications… (More)
Is this relevant?
2011
2011
In this paper, we study the local behavior of the solutions to the 3-dimensional magnetohydrodynamic equations. We are interested… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
This paper addresses the problem of establishing correspondences between two sets of visual features using higher order… (More)
  • figure I
  • figure 3
  • figure 2
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We use ground-based observations of CO mixing ratios and vertical column abundances together with tropo-spheric NO 2 columns from… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • table 1
Is this relevant?
2001
2001
For a group G, the notion of a ribbon G-category was introduced in Turaev (Homotopy 4eld theory in dimension 3 and crossed group… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • table 1
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We prove that maximum three dimensional matching is a MAX SNP-hard problem. If the number of occurrences of elements in triples… (More)
Is this relevant?