Add to ORKGA hypergraph is a generalization of a graph where each hyperedge can contain an arbitrary number of vertices. The hypergraph matching problem is to find a largest collection of disjoint hyperedges. While matching on general graphs is polynomial time solvable, hypergraph matching is NP-hard and there is no good approximation algorithm for the problem in its most general form. We study the restricted case where every hyperedge consists o
Given a weighted simple graph, the minimum weighted maximal matching (MWMM) problem is the problem o...
AbstractIt is known that the edge set of a connected graph of even size has a partition into pairs o...
AbstractFor a graph property P, we define a P-matching as a set M of disjoint edges such that the su...
We consider the problem of finding polynomial-time approximations of maximal weighted k-matchings i...
The problem of finding a maximum cardinality matching in a d-partite, d-uniform hypergraph is an imp...
AbstractWe consider the problem of finding polynomial-time approximations of maximal weighted k-matc...
Given a set of nodes and edges between them, what’s the maximum of number of disjoint edges? This pr...
In a graph G a matching is a set of edges in which no two edges have a common endpoint. An induced m...
Haxell's condition [14] is a natural hypergraph analog of Hall's condition, which is a well-known ne...
We investigate the distributed complexity of maximal matching and maximal independent set (MIS) in h...
We develop a theory for the existence of perfect matchings in hypergraphs under quite general condit...
AbstractThis article presents an infinite family of combinatorial problems that shows abrupt changes...
An induced matching M of a graph G is a set of pairwise non-adjacent edges such that their end-verti...
Abstract. In 1965 Erdős conjectured that the number of edges in k-uniform hypergraphs on n vertices...
More than forty years ago, Erdős conjectured that for any , every k-uniform hypergraph on n vertices...
Given a weighted simple graph, the minimum weighted maximal matching (MWMM) problem is the problem o...
AbstractIt is known that the edge set of a connected graph of even size has a partition into pairs o...
AbstractFor a graph property P, we define a P-matching as a set M of disjoint edges such that the su...
We consider the problem of finding polynomial-time approximations of maximal weighted k-matchings i...
The problem of finding a maximum cardinality matching in a d-partite, d-uniform hypergraph is an imp...
AbstractWe consider the problem of finding polynomial-time approximations of maximal weighted k-matc...
Given a set of nodes and edges between them, what’s the maximum of number of disjoint edges? This pr...
In a graph G a matching is a set of edges in which no two edges have a common endpoint. An induced m...
Haxell's condition [14] is a natural hypergraph analog of Hall's condition, which is a well-known ne...
We investigate the distributed complexity of maximal matching and maximal independent set (MIS) in h...
We develop a theory for the existence of perfect matchings in hypergraphs under quite general condit...
AbstractThis article presents an infinite family of combinatorial problems that shows abrupt changes...
An induced matching M of a graph G is a set of pairwise non-adjacent edges such that their end-verti...
Abstract. In 1965 Erdős conjectured that the number of edges in k-uniform hypergraphs on n vertices...
More than forty years ago, Erdős conjectured that for any , every k-uniform hypergraph on n vertices...
Given a weighted simple graph, the minimum weighted maximal matching (MWMM) problem is the problem o...
AbstractIt is known that the edge set of a connected graph of even size has a partition into pairs o...
AbstractFor a graph property P, we define a P-matching as a set M of disjoint edges such that the su...