Biclique coverings, rectifier networks and the cost of $\epsilon$-removal

Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György +2

We relate two complexity notions of bipartite graphs: the minimal weight biclique covering number $\mathrm{Cov}(G)$ and the minimal rectifier network size $\mathrm{Rect}(G)$ of a b…