An Efficient Sparse Regularity Concept

@inproceedings{CojaOghlan2009AnES,
  title={An Efficient Sparse Regularity Concept},
  author={Amin Coja-Oghlan and Colin S Cooper and Alan M. Frieze},
  booktitle={SIAM J. Discrete Math.},
  year={2009}
}
Let A be a 0/1 matrix of size m × n, and let p be the density of A (i.e., the number of ones divided by m · n). We show that A can be approximated in the cut norm within ε ·mnp by a sum of cut matrices (of rank 1), where the number of summands is independent of the sizem ·n of A, provided that A satisfies a certain boundedness condition. This decomposition can be computed in polynomial time. This result extends the work of Frieze and Kannan [16] to sparse matrices. As an application, we obtain… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Similar Papers

Loading similar papers…