604 search results - page 31 / 121 » On the Complexity of the Maximum Cut Problem |
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
IPL
2008
14 years 9 months ago
2008
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
COMAD
2008
14 years 11 months ago
2008
An important problem in biological data analysis is to predict the family of a newly discovered sequence like a protein or DNA sequence, using the collection of available sequence...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
DAM
2008
14 years 10 months ago
2008
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...