426 citations · 435 across the 4 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2017
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…
cs.IT2017★ 9 cited
Regular Decomposition: an information and graph theoretic approach to stochastic block models
Hannu Reittu, Fülöp Bazsó, Ilkka Norros
A method for compression of large graphs and non-negative matrices to a block structure is proposed. Szemerédi's regularity lemma is used as heuristic motivation of the significanc…