A New Algorithm for the Robust Semi-random Independent Set Problem

by   Theo McKenzie, et al.

In this paper, we study a semi-random version of the planted independent set problem in a model initially proposed by Feige and Kilian, which has a large proportion of adversarial edges. We give a new deterministic algorithm that finds a list of independent sets, one of which, with high probability, is the planted one, provided that the planted set has size k=Ω(n^2/3).


page 1

page 2

page 3

page 4


Independent Sets of Random Trees and of Sparse Random Graphs

An independent set of size k in a finite undirected graph G is a set of ...

Independent Sets in Semi-random Hypergraphs

A set of vertices in a hypergraph is called an independent set if no hyp...

Asymptotic performance of the Grimmett-McDiarmid heuristic

Grimmett and McDiarmid suggested a simple heuristic for finding stable s...

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process

The semi-random graph process is a single player game in which the playe...

Large independent sets in Markov random graphs

Computing the maximum size of an independent set in a graph is a famousl...

ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems

Given a graph G and two independent sets S, T of G, the independent set ...

On random primitive sets, directable NDFAs and the generation of slowly synchronizing DFAs

We tackle the problem of the randomized generation of slowly synchronizi...

Please sign up or login with your details

Forgot password? Click here to reset