Computing Top-k Closeness Centrality Faster in Unweighted Graphs. | 8 | 0.44 | 2017 |
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs. | 0 | 0.34 | 2017 |
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation. | 7 | 0.50 | 2016 |
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games. | 3 | 0.39 | 2015 |
On Computing the Hyperbolicity of Real-World Graphs | 6 | 0.50 | 2015 |
Fast and Simple Computation of Top-k Closeness Centralities | 5 | 0.42 | 2015 |
Into the Square - On the Complexity of Quadratic-Time Solvable Problems. | 2 | 0.36 | 2014 |
Telling metabolic stories to explore metabolomics data: a case study on the yeast response to cadmium exposure. | 3 | 0.39 | 2014 |
On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. | 5 | 0.43 | 2014 |
Telling Stories Fast. | 1 | 0.37 | 2013 |