A k-core of a graph is a maximal connected subgraph in which every vertex is connected to
at least k vertices in the subgraph. k-core decomposition is often used in large-scale network …

A k-core of a graph is a maximal connected subgraph in which every vertex is connected to
at least k vertices in the subgraph. k-core decomposition is often used in large-scale network …

The air transportation network, a fundamental component of critical infrastructure, is formed
from a collection of individual air carriers, each one with a methodically designed and …

The organisation of a network in a maximal set of nodes having at least k neighbours within
the set, known as k-core decomposition, has been used for studying various phenomena. It …

K-core decomposition is a commonly used metric to analyze graph structure or study the
relative importance of nodes in complex graphs. Recent years have seen rapid growth in the …

In this section, we present a two-phase heuristic for crossing reduction in circular layouts.
While the first algorithm uses a greedy policy to build a good initial layout, an adaptation of …

In graph theory and network analysis, node degree is defined as a simple but powerful
centrality to measure the local influence of node in a complex network. Preferential …

The experimental evaluation of many graph algorithms for practical use involves both tests
on realworld data and on artificially generated data sets. In particular the latter are useful for …

During the last few years the Internet has become more and more important, not only for
business communication but also for many private households. Current news, information …

Networks have played an important role in the development of modern culture and
technology. While social networks have helped develop the complex societies of today's …