The problem with computing the average distance and the diameter in the case of huge networks is the time and space complexity. For this reason, heuristics or approximation algorithms are often used.In this paper we first discuss the approximation methods for the distance distribution and then we focus on the exact computation of diameter.
Degrees of Separation and Diameter in Large Graphs / Crescenzi, Pierluigi; Marino, Andrea. - ELETTRONICO. - (2018), pp. 1-7. [10.1007/978-3-319-63962-8_59-1]
Degrees of Separation and Diameter in Large Graphs
Crescenzi, Pierluigi;Marino, Andrea
2018
Abstract
The problem with computing the average distance and the diameter in the case of huge networks is the time and space complexity. For this reason, heuristics or approximation algorithms are often used.In this paper we first discuss the approximation methods for the distance distribution and then we focus on the exact computation of diameter.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
