Detecting anomalies in data is a vital task, with numerous high-impact applications in areas
such as security, finance, health care, and law enforcement. While numerous techniques …

With the emergence of data science, graph computing is becoming a crucial tool for
processing big connected data. Although efficient implementations of specific graph …

The spanning centrality of an edge e in an undirected graph G is the fraction of the spanning
trees of G that contain e. Despite its appealing definition and apparent value in certain …

Given a set of target nodes S in a graph G we define the betweenness centrality of a node v
with respect to S as the fraction of shortest paths among nodes in S that contain v. For this …

Представлены два способа классификации мер центральности акторов сети: с точки
зрения конкурирующих гипотез об отношении между структурными свойствами сети и …

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 …

The maximum common subgraph isomorphism problem is a difficult graph problem, and the
problem of finding the maximum common subgraph isomorphism problem is NP-hard. This …

Social network analysis is nowadays attracting many researchers from different domains to
study a large spectrum of issues such as node centrality (the position of nodes in the …

Why are some people more creative than others? How do human brain networks evolve
over time? A key stepping stone to both mysteries and many more is to compare weighted …

Characterizing user pair relationships is important for applications such as friend
recommendation and interest targeting in online social networks (OSNs). Due to the large …