Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs
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 …
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
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 …
complex networks. Among these, it is worth considering the bitcoin blockchain, because of …
Uncovering the bitcoin blockchain: an analysis of the full users graph
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 …
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 …
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
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 …
any two vertices. There are no known very efficient algorithms for computing the Diameter …
Detecting artificial behaviours in the bitcoin users graph
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 …
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
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 …
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 …
(eg, images, multivariate time series, molecules, video, text strings, networks). Graph theory …
Collaborative filtering recommendations based on multi-factor random walks
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 …
is affected by data sparsity. Random walks can harvest the behavioral relationships between …
An analysis of the bitcoin users graph: inferring unusual behaviours
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 …
unique feature of this system is that the list of all the economic transactions is publicly …