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 semi-random graph of order n. As an application we obtain an algorithm that requires only O(n) random edges in order to k-color a semirandom k-colorable graph within polynomial expected time, thereby extending the results of Feige and Kilian [7] and of Subramanian [15].

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call