When is a sequence of integers realizable as the degree sequence of a graph? There are well known necessary and suucient conditions for a sequence of integers to constitute degrees of a graph 1]. There exists a sequential linear time algorithm that construct a graph from a given degree sequence. This algorithm however seems to be inherenty sequencial, and thus hard to parallelize. In this paper...

We present improved deterministic distributed algorithms for a number of well-studied matching problems, which are simpler, faster, more accurate, and/or more general than their known counterparts. The common denominator of these results is a deterministic distributed rounding method for certain linear programs, which is the first such rounding method, to our knowledge. A sampling of our end re...

In the paper, we propose a newly registration method for multi-temporal image registration. Multi-temporal image registration has two difficulties: one is how to design matching strategy to gain enough initial correspondence points. Because the wrong matching correspondence points are unavoidable, we are unable to know how many outliers, so the second difficult of registration is how to calcula...

This paper presents an algorithm for estimating the weight of a maximum weighted matching by augmenting any estimation routine for the size of an unweighted matching. The algorithm is implementable in any streaming model including dynamic graph streams. We also give the first constant estimation for the maximum matching size in a dynamic graph stream for planar graphs (or any graph with bounded...

The 0/1 primal separation problem is: Given an extreme point x̄ of a 0/1 polytope P and some point x , find an inequality which is tight at x̄, violated by x and valid for P or assert that no such inequality exists. It is known that this separation variant can be reduced to the standard separation problem for P. We show that 0/1 optimization and 0/1 primal separation are polynomial time equivalen...

An (N +N) evolutionary algorithm is considered for the problem of finding the maximum cardinality matching in a graph. It is shown that the performance of the evolutionary algorithm is the same as classical simulated annealing. That is, the evolutionary algorithm cannot find the maximum matching in polynomial average time for a family of bipartite graphs considered in this paper although there ...

We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O( ω ) using O(nmax(2ω,4+ω)) processing elements for ω ≥ 1. Parameter ω is not bounded. This is the fastest known strongly polynomial parallel algorithm to solve this problem. This is also the first adjustable parallel algorithm for the maximum weight bipartite...

We propose a novel solution for semantic-based XML schema matching, taking a mathematical programming approach. This method identifies the globally optimal solution for the problem of matching two XML schemas by reducing the tree-to-tree matching problem to simpler problems of pathto-path, node-to-node, and word-to-word matching. We formulate these matching problems as maximum-weighted bipartit...

For a bipartite graph G = (V, E), (1) perfect, (2) maximum and (3) maximal matchings are matchings (1) such that all vertices are incident to some matching edges, (2) whose cardinalities are maximum among all matchings, (3) which are contained in no other matching. In this paper, we present three algorithms for enumerating these three types of matchings. Their time complexities are O(|V |) per ...

Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximum weighted matching of that graph. We show that a variant of the obvious sequential greedy algorithm [Pre99], that computes a weighted matching at most a factor 2 away from the maximum, is easily distributed. This yiel...