Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs

A Abboud, VV Williams, J Wang - Proceedings of the twenty-seventh annual …, 2016 - SIAM
The radius and diameter are fundamental graph parameters, with several natural definitions
for directed graphs. Each definition is well-motivated in a variety of applications. All versions …

Data-driven analysis of bitcoin properties: exploiting the users graph

D Di Francesco Maesa, A Marino, L Ricci - International Journal of Data …, 2018 - Springer
Data analytic has recently enabled the uncovering of interesting properties of several
complex networks. Among these, it is worth considering the bitcoin blockchain, because of …

Uncovering the bitcoin blockchain: an analysis of the full users graph

DDF Maesa, A Marino, L Ricci - 2016 IEEE international …, 2016 - ieeexplore.ieee.org
BITCOIN is a novel decentralized cryptocurrency system which has recently received a great
attention from a wider audience. An interesting and unique feature of this system is that the …

Into the square: On the complexity of some quadratic-time solvable problems

M Borassi, P Crescenzi, M Habib - Electronic Notes in Theoretical …, 2016 - Elsevier
We analyze several quadratic-time solvable problems, and we show that these problems are
not solvable in truly subquadratic time (that is, in time O (n 2− ϵ) for some ϵ> 0), unless the …

Towards tight approximation bounds for graph diameter and eccentricities

A Backurs, L Roditty, G Segal, VV Williams… - Proceedings of the 50th …, 2018 - dl.acm.org
Among the most important graph parameters is the Diameter, the largest distance between
any two vertices. There are no known very efficient algorithms for computing the Diameter …

Detecting artificial behaviours in the bitcoin users graph

DDF Maesa, A Marino, L Ricci - Online Social Networks and Media, 2017 - Elsevier
A unique feature of cryptocurrencies such as Bitcoin is that the blockchain containing all the
economic transactions is publicly available. This makes it possible to obtain insights in the …

[HTML][HTML] Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games

M Borassi, P Crescenzi, M Habib, WA Kosters… - Theoretical Computer …, 2015 - Elsevier
In this paper, we propose a new algorithm that computes the radius and the diameter of a
weakly connected digraph G=(V, E), by finding bounds through heuristics and improving …

PlasmoData. jl—A Julia framework for modeling and analyzing complex data as graphs

DL Cole, VM Zavala - Computers & Chemical Engineering, 2024 - Elsevier
Datasets encountered in scientific and engineering applications appear in complex formats
(eg, images, multivariate time series, molecules, video, text strings, networks). Graph theory …

Collaborative filtering recommendations based on multi-factor random walks

L Guo, K Luan, L Sun, Y Luo, X Zheng - Engineering Applications of …, 2023 - Elsevier
Using trust relationships can improve the accuracy of recommendation systems; however, it
is affected by data sparsity. Random walks can harvest the behavioral relationships between …

An analysis of the bitcoin users graph: inferring unusual behaviours

D Di Francesco Maesa, A Marino, L Ricci - Complex Networks & Their …, 2017 - Springer
An increasing interest on cryptocurrencies has recently raised, in particular on bitcoin. A
unique feature of this system is that the list of all the economic transactions is publicly …