AbstractWe show that a restricted form of the perfect matching problem for bipartite graphs is NP-complete. The restriction involves partitions of the vertices of the graph. This problem is still NP-complete if the degrees of the vertices are restricted to be 3 or less. For degrees restricted to 2 or less, a polynomial time algorithm exists
International audienceGiven a bipartite graph G=(U∪V,E) such that ∣U∣=∣V∣ and every edge is labelled...
AbstractThis paper considers an algorithm for finding a perfect matching, if there is one, in a bipa...
AbstractGiven a bipartite graph G=(U∪V,E) such that ∣U∣=∣V∣ and every edge is labelled true or false...
We show that the problem of deciding whether the edge set of a bipartite graph can be partitioned in...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
AbstractWe discuss a special case of the Exact Perfect Matching Problem, which is polynomially solva...
AbstractGiven a bipartite graph G=(U∪V,E) such that ∣U∣=∣V∣ and every edge is labelled true or false...
Under embargo until: 2022-09-20In a graph, a perfect matching cut is an edge cut that is a perfect m...
AbstractA theorem of Stein (1975, 1979) states that for every n × n (n ⩾ 3) complete bipartite graph...
The perfect matching problem is known to be in P, in randomized NC, and it is hard for NL. Whether t...
Abstract. Given a bipartite graph G = (X _ [ D;E X D), an X-perfect matching is a matching in G th...
AbstractThis paper describes an algorithm for finding all the perfect matchings in a bipartite graph...
Given a bipartite graph G = (U ∪ V , E ) such that |U | = |V | and every edge is labelled true or f...
Given a bipartite graph G = (U υ V,E) such that |U| = |V | and every edge is labelled true or false ...
The perfect matching problem is known to be in P, in randomizedNC, and it is hard forNL. Whether the...
International audienceGiven a bipartite graph G=(U∪V,E) such that ∣U∣=∣V∣ and every edge is labelled...
AbstractThis paper considers an algorithm for finding a perfect matching, if there is one, in a bipa...
AbstractGiven a bipartite graph G=(U∪V,E) such that ∣U∣=∣V∣ and every edge is labelled true or false...
We show that the problem of deciding whether the edge set of a bipartite graph can be partitioned in...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
AbstractWe discuss a special case of the Exact Perfect Matching Problem, which is polynomially solva...
AbstractGiven a bipartite graph G=(U∪V,E) such that ∣U∣=∣V∣ and every edge is labelled true or false...
Under embargo until: 2022-09-20In a graph, a perfect matching cut is an edge cut that is a perfect m...
AbstractA theorem of Stein (1975, 1979) states that for every n × n (n ⩾ 3) complete bipartite graph...
The perfect matching problem is known to be in P, in randomized NC, and it is hard for NL. Whether t...
Abstract. Given a bipartite graph G = (X _ [ D;E X D), an X-perfect matching is a matching in G th...
AbstractThis paper describes an algorithm for finding all the perfect matchings in a bipartite graph...
Given a bipartite graph G = (U ∪ V , E ) such that |U | = |V | and every edge is labelled true or f...
Given a bipartite graph G = (U υ V,E) such that |U| = |V | and every edge is labelled true or false ...
The perfect matching problem is known to be in P, in randomizedNC, and it is hard forNL. Whether the...
International audienceGiven a bipartite graph G=(U∪V,E) such that ∣U∣=∣V∣ and every edge is labelled...
AbstractThis paper considers an algorithm for finding a perfect matching, if there is one, in a bipa...
AbstractGiven a bipartite graph G=(U∪V,E) such that ∣U∣=∣V∣ and every edge is labelled true or false...
DOI
Add to ORKG