Guidelines for Experimental Algorithmics: A Case Study in Network Analysis. | 1 | 0.37 | 2019 |
Guidelines for Experimental Algorithmics in Network Analysis. | 0 | 0.34 | 2019 |
Updating Dynamic Random Hyperbolic Graphs in Sublinear Time | 0 | 0.34 | 2018 |
Balanced K-Means For Parallel Geometric Partitioning | 1 | 0.37 | 2018 |
Communication-Free Massively Distributed Graph Generation | 2 | 0.37 | 2018 |
Generating massive complex networks with hyperbolic geometry faster in practice | 6 | 0.44 | 2016 |
Better partitions of protein graphs for subsystem quantum chemistry. | 0 | 0.34 | 2016 |
Generating Random Hyperbolic Graphs in Subquadratic Time. | 12 | 0.64 | 2015 |
Querying Probabilistic Neighborhoods In Spatial Data Sets Efficiently | 3 | 0.45 | 2015 |
Fast generation of dynamic complex networks with underlying hyperbolic geometry. | 5 | 0.46 | 2015 |