We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
The Laurent Decomposition expresses any binary single-h CPM waveform as the summation of a finite number of pulse amplitude modulated components, and this result has been useful i...
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing