Michele Borassi

Identifiers

No identifiers captured yet.

Papers (7)

1. Computing top-k Closeness Centrality Faster in Unweighted Graphs cs.DS · 2017 · author #2
2. KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation cs.DS · 2016 · author #1
3. An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs cs.CC · 2016 · author #1
4. A Note on the Complexity of Computing the Number of Reachable Vertices in a Digraph cs.CC · 2016 · author #1
5. Fast and Simple Computation of Top-k Closeness Centralities cs.DS · 2015 · author #1
6. Hyperbolicity Measures "Democracy" in Real-World Networks physics.soc-ph · 2015 · author #1
7. Into the Square - On the Complexity of Quadratic-Time Solvable Problems cs.CC · 2014 · author #1

Mentions

No mention provenance yet.

Frequent Coauthors

• Pierluigi Crescenzi 4 shared papers
• Andrea Marino 2 shared papers
• Alessandro Chessa 1 shared papers
• Elisabetta Bergamini 1 shared papers
• Emanuele Natale 1 shared papers
• Guido Caldarelli 1 shared papers
• Henning Meyerhenke 1 shared papers
• Luca Trevisan 1 shared papers
• Michel Habib 1 shared papers