Michele Borassi

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Computing top-k closeness centrality faster in unweighted graphs 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX)	2019-09-12	Paper
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation ACM Journal of Experimental Algorithmics	2019-03-27	Paper
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation ACM Journal of Experimental Algorithmics	2019-03-27	Paper
An axiomatic and an average-case analysis of algorithms and heuristics for metric properties of graphs Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
KADABRA is an adaptive algorithm for betweenness via random approximation	2018-03-02	Paper
Into the square: on the complexity of some quadratic-time solvable problems (available as arXiv preprint)	2016-08-05	Paper
A note on the complexity of computing the number of reachable vertices in a digraph Information Processing Letters	2016-07-07	Paper
On computing the hyperbolicity of real-world graphs Algorithms - ESA 2015	2015-11-19	Paper
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs Theoretical Computer Science	2015-05-26	Paper

Research outcomes over time

This page was built for person: Michele Borassi