Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
A parallel algorithm based on the multidimensional minimization of the Rayleigh quotient is proposed to evaluate the leftmost eigenpairs of the generalized symmetric positive defi...
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
In this paper, we examine the problem of overcomplete representations and provide new insights into the problem of stable recovery of sparse solutions in noisy environments. We es...