On directed analogues of expander and hyperfinite graph sequences. | 0 | 0.34 | 2022 |
Positive graphs. | 0 | 0.34 | 2016 |
Independent sets and cuts in large-girth regular graphs. | 0 | 0.34 | 2016 |
Several Tokens in Herman's algorithm. | 0 | 0.34 | 2015 |
Invariant Gaussian processes and independent sets on regular graphs of large girth | 8 | 0.65 | 2015 |
Limits of some combinatorial problems | 0 | 0.34 | 2015 |
Emergence of bimodality in controlling complex networks | 33 | 1.59 | 2015 |
A macro placer algorithm for chip design | 0 | 0.34 | 2015 |
On the graph limit question of Vera T. Sós. | 0 | 0.34 | 2015 |
An Undecidability Result on Limits of Sparse Graphs. | 0 | 0.34 | 2012 |
Core Percolation On Complex Networks | 2 | 0.45 | 2012 |
Random local algorithms | 0 | 0.34 | 2012 |
Maximum flow is approximable by deterministic constant-time algorithm in sparse networks | 1 | 0.35 | 2010 |
Efficient design of stochastic mechanisms | 0 | 0.34 | 2006 |