Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
Given an undirected graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtai...