Frigyes Karinthy, in his 1929 short story" Láncszemek"(in English," Chains") suggested that
any two persons are distanced by at most six friendship links. 1 Stanley Milgram in his …

We introduce NetworKit, an open-source software package for analyzing the structure of
large complex networks. Appropriate algorithmic solutions are required to handle …

Identifying the connected components of a graph, apart from being a fundamental problem
with countless applications, is a key primitive for many other algorithms. In this paper, we …

Wireless sensor networks (WSNs) have several applications ranging from the civilian to
military applications. WSNs are prone to various hole attacks, such as sinkhole, wormhole …

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 …

We introduce NetworKit, an open-source software package for high-performance analysis of
large complex networks. Complex networks are equally attractive and challenging targets for …

The eccentricity of a node in a graph is defined as the length of a longest shortest path
starting at that node. The eccentricity distribution over all nodes is a relevant descriptive …

The number one criticism of average-case analysis is that we do not actually know the
probability distribution of real-world inputs. Thus, analyzing an algorithm on some random …

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 …

Widespread usage of complex interconnected social networks such as Facebook, Twitter
and LinkedInin modern internet era has also unfortunately opened the door for privacy …