Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Borassi, Michele"'
Autor:
Borassi, Michele, Epasto, Alessandro, Lattanzi, Silvio, Vassilvitskii, Sergei, Zadimoghaddam, Morteza
Publikováno v:
In Proceedings of the 34th Conference on Neural Information Processing Systems (NeurIPS 2020)
The sliding window model of computation captures scenarios in which data is arriving continuously, but only the latest $w$ elements should be used for analysis. The goal is to design algorithms that update the solution efficiently with each arrival r
Externí odkaz:
http://arxiv.org/abs/2006.05850
Autor:
Bergamini, Elisabetta, Borassi, Michele, Crescenzi, Pierluigi, Marino, Andrea, Meyerhenke, Henning
Given a connected graph $G=(V,E)$, the closeness centrality of a vertex $v$ is defined as $\frac{n-1}{\sum_{w \in V} d(v,w)}$. This measure is widely used in the analysis of real-world complex networks, and the problem of selecting the $k$ most centr
Externí odkaz:
http://arxiv.org/abs/1704.01077
Autor:
Borassi, Michele, Natale, Emanuele
We present KADABRA, a new algorithm to approximate betweenness centrality in directed and undirected graphs, which significantly outperforms all previous approaches on real-world complex networks. The efficiency of the new algorithm relies on two new
Externí odkaz:
http://arxiv.org/abs/1604.08553
In recent years, researchers proposed several algorithms that compute metric quantities of real-world complex networks, and that are very efficient in practice, although there is no worst-case guarantee. In this work, we propose an axiomatic framewor
Externí odkaz:
http://arxiv.org/abs/1604.01445
Autor:
Borassi, Michele
In this work, we consider the following problem: given a digraph $G=(V,E)$, for each vertex $v$, we want to compute the number of vertices reachable from $v$. In other words, we want to compute the out-degree of each vertex in the transitive closure
Externí odkaz:
http://arxiv.org/abs/1602.02129
Closeness is an important centrality measure widely used in the analysis of real-world complex networks. In particular, the problem of selecting the k most central nodes with respect to this measure has been deeply analyzed in the last decade. Howeve
Externí odkaz:
http://arxiv.org/abs/1507.01490
Publikováno v:
Phys. Rev. E 92, 032812 (2015)
We analyze the hyperbolicity of real-world networks, a geometric quantity that measures if a space is negatively curved. In our interpretation, a network with small hyperbolicity is "aristocratic", because it contains a small set of vertices involved
Externí odkaz:
http://arxiv.org/abs/1503.03061
This paper will analyze several quadratic-time solvable problems, and will classify them into two classes: problems that are solvable in truly subquadratic time (that is, in time $O(n^{2-\epsilon})$ for some $\epsilon>0$) and problems that are not, u
Externí odkaz:
http://arxiv.org/abs/1407.4972
Autor:
Borassi, Michele, Crescenzi, Pierluigi, Habib, Michel, Kosters, Walter A., Marino, Andrea, Takes, Frank W.
Publikováno v:
In Theoretical Computer Science 27 June 2015 586:59-80
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.