It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
In this paper we study the performance of a particular on-line coloring algorithm, the First-Fit or Greedy algorithm, on a class of perfect graphs namely the permutation graphs. W...
— Recently linear processing strategies have been developed to approach the optimum performance of dirty paper coding with low complexity in multiuser multiple-input multipleoutp...
A first order affine scaling method and two mth order affine scaling methods for solving monotone linear complementarity problems (LCP) are presented. All three methods produce ite...
It is now well known that time invariant (TI) linear beamformers, such as the Capon’s beamformer, are only optimal for stationary Gaussian observations whose complex envelope is...
Pascal Chevalier, Abdelkader Oukaci, Jean Pierre D...