Motivated by the observation that most companies are more likely to consider job applicants suggested by their employees than those who apply on their own, Arcaute and Vassilvitskii modeled a job market that integrates social networks into stable matchings in an interesting way. We call their model HR+SN because an instance of their model is an ordered pair (I,G) where I is a typical instance o...

The maximum matching width is a width-parameter that is defined on a branchdecomposition over the vertex set of a graph. The size of a maximum matching in the bipartite graph is used as a cut-function. In this paper, we characterize the graphs of maximum matching width at most 2 using the minor obstruction set. Also, we compute the exact value of the maximum matching width of a grid.

This paper describes maximum likelihood estimation techniques for performing rover localization in natural terrain by matching range maps. An occupancy map of the local terrain is rst generated using stereo vision. The position of the rover with respect to a previously generated occupancy map is then computed by comparing the maps using a probabilistic formulation of image matching techniques. ...

An (f, g)-semi-matching in a bipartite graph G = (U ∪V,E) is a set of edges M ⊆ E such that each vertex u ∈ U is incident with at most f(u) edges of M , and each vertex v ∈ V is incident with at most g(v) edges of M . In this paper we give an algorithm that for a graph with n vertices and m edges, n ≤ m, constructs a maximum (f, g)semi-matching in running time O(m ·min( √∑ u∈U f(u), √∑ v∈V g(v)...

Among scheduling algorithms used in input queued switches, it is known that the Maximum Size Matching (MSM) algorithm maximizes the instantaneous throughput. Although there have been results on the stability of some specific types of MSMs for scheduling traffic [5], the question of how it performs under uniform traffic remains open. Simulations suggest the stability of MSM algorithms under unif...

Given a bipartite graph G(V,E), V = A ∪̇B where |V | = n, |E| = m and a partition of the edge set into r ≤ m disjoint subsets E = E1 ∪̇E2 ∪̇ . . . ∪̇Er, which are called ranks, the rank-maximal matching problem is to find a matching M of G such that |M ∩ E1| is maximized and given that |M ∩ E1| is maximized, |M ∩ E2| is also maximized, and so on. Such a problem arises as an optimization criteria ov...