AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-connected 4-regular graphs) is AC0-equivalent with the general perfect matching problem for arbitrary graphs
In the Exact Matching Problem (EM), we are given a graph equipped with a fixed coloring of its edges...
In the Exact Matching Problem (EM), we are given a graph equipped with a fixed coloring of its edges...
AbstractTutte's theorem on perfect matchings is considered from the viewpoint of the Marriage Proble...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
AbstractWe show that a restricted form of the perfect matching problem for bipartite graphs is NP-co...
It is known that finding a perfect matching in a general graph is AC0-equivalent to finding a perfe...
It is known that finding a perfect matching in a general graph is AC0-equivalent to finding a perfe...
The perfect matching problem is known to be in P, in randomized NC, and it is hard for NL. Whether t...
Under embargo until: 2022-09-20In a graph, a perfect matching cut is an edge cut that is a perfect m...
The perfect matching problem is known to be in P, in randomizedNC, and it is hard forNL. Whether the...
We exhibit the following new upper bounds on the space complexity and the parallel complexity of the...
AbstractWe discuss a special case of the Exact Perfect Matching Problem, which is polynomially solva...
AbstractLet H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there e...
In this paper, we consider the minimum maximal matching problem in some classes of graphs such as re...
We show that the problem of deciding whether the edge set of a bipartite graph can be partitioned in...
In the Exact Matching Problem (EM), we are given a graph equipped with a fixed coloring of its edges...
In the Exact Matching Problem (EM), we are given a graph equipped with a fixed coloring of its edges...
AbstractTutte's theorem on perfect matchings is considered from the viewpoint of the Marriage Proble...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
AbstractWe show that a restricted form of the perfect matching problem for bipartite graphs is NP-co...
It is known that finding a perfect matching in a general graph is AC0-equivalent to finding a perfe...
It is known that finding a perfect matching in a general graph is AC0-equivalent to finding a perfe...
The perfect matching problem is known to be in P, in randomized NC, and it is hard for NL. Whether t...
Under embargo until: 2022-09-20In a graph, a perfect matching cut is an edge cut that is a perfect m...
The perfect matching problem is known to be in P, in randomizedNC, and it is hard forNL. Whether the...
We exhibit the following new upper bounds on the space complexity and the parallel complexity of the...
AbstractWe discuss a special case of the Exact Perfect Matching Problem, which is polynomially solva...
AbstractLet H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there e...
In this paper, we consider the minimum maximal matching problem in some classes of graphs such as re...
We show that the problem of deciding whether the edge set of a bipartite graph can be partitioned in...
In the Exact Matching Problem (EM), we are given a graph equipped with a fixed coloring of its edges...
In the Exact Matching Problem (EM), we are given a graph equipped with a fixed coloring of its edges...
AbstractTutte's theorem on perfect matchings is considered from the viewpoint of the Marriage Proble...
DOI
Add to ORKG