7 citations · 11 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2009★ 1 cited
Borel oracles. An analytical approach to constant-time algorithms
Gabor Elek, Gabor Lippner
Nguyen and Onak constructed the first constant-time algorithm for the approximation of the size of the maximum matching in bounded degree graphs. The Borel oracle machinery is a to…
math.CO2008★ 7 cited
An analogue of the Szemeredi Regularity Lemma for bounded degree graphs
Gábor Elek, Gábor Lippner
We show that a sufficiently large graph of bounded degree can be decomposed into quasi-homogeneous pieces. The result can be viewed as a "finitarization" of the classical Farrell-V…