24 citations · 48 across the 15 of their papers we have counts for
5 papers · 1 filter
A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs
Alkida Balliu, Filippo Brunelli, Pierluigi Crescenzi +2
A temporal graph is a graph in which edges are assigned a time label. Two nodes u and v of a temporal graph are connected one to the other if there exists a path from u to v with i…
On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks
Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot
A weighted point-availability time-dependent network is a list of temporal edges, where each temporal edge has an appearing time value, a travel time value, and a cost value. In th…
Computing top-k Closeness Centrality Faster in Unweighted Graphs
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi +2
Given a connected graph , the closeness centrality of a vertex is defined as . This measure is widely used in the analysis of real-w…
Improving the betweenness centrality of a node by adding links
Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo +3
Betweenness is a well-known centrality measure that ranks the nodes according to their participation in the shortest paths of a network. In several scenarios, having a high between…
Fast and Simple Computation of Top-k Closeness Centralities
Michele Borassi, Pierluigi Crescenzi, Andrea Marino
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 respe…