A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Simultaneous Matchings
[chapter]
2005
Lecture Notes in Computer Science
Given a bipartite graph G = (X ∪ D, E ⊆ X × D), an Xperfect matching is a matching in G that saturates every node in X. In this paper we study the following generalisation of the X-perfect matching problem, which has applications in constraint programming: Given a bipartite graph as above and a collection F ⊆ 2 X of k subsets of X, find a subset M ⊆ E of the edges such that for each C ∈ F, the edge set M ∩ (C × D) is a C-perfect matching in G (or report that no such set exists). We show that
doi:10.1007/11602613_12
fatcat:bp2pstjafjbkbgktmjs5txp4tm