| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429336 | Journal of Algorithms | 2007 | 28 Pages |
Abstract
The aim of this paper is to present an SDP-based algorithm for finding a sparse induced subgraph of order Θ(n) hidden in a semirandom graph of order n. As an application we obtain an algorithm that requires not more than O(n) random edges in order to k-color a semirandom k-colorable graph within polynomial expected time, thereby extending results of Feige and Kilian [J. Comput. System Sci. 63 (2001) 639–671] and of Subramanian [J. Algorithms 33 (1999) 112–123].
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
