Regular decomposition of large graphs and other structures: scalability and robustness towards missing data

Hannu Reittu, Ilkka Norros, Fülöp Bazsó

A method for compression of large graphs and matrices to a block structure is further developed. Szemerédi's regularity lemma is used as a generic motivation of the significance of…