We analyze the data about works (papers, books) from the time period 1990–2010 that are collected in Zentralblatt MATH database. The data were converted into four 2-mode networks (works

The structure of a large network (graph) can often be revealed by partitioning it into smaller and possibly more dense sub-networks that are easier to handle. One of such decompositions is based on “

The structure of a large network (graph) can often be revealed by partitioning it into smaller and possibly more dense sub-networks that are easier to handle. One of such decompositions is based on “ k -cores”, proposed in 1983 by Seidman. Together with connectivity components, cores are one among few concepts that provide efficient decompositions of large graphs and networks. In this paper we propose an efficient algorithm for determining the cores decomposition of a given network with complexity $$O(m)$$, where m is the number of lines (edges or arcs). In the second part of the paper the classical concept of k -core is generalized in a way that uses a vertex property function instead of degree of a vertex. For local monotone vertex property functions the corresponding generalized cores can be determined in $$O(motn))$$ time, where n is the number of vertices and Δ is the maximum degree. Finally the proposed algorithms are illustrated by the analysis of a collaboration network in the field of computational geometry.

In this paper, we present a case study for the visualisation and analysis of large and complex temporal multivariate networks derived from the Internet movie database (IMDB). Our approach is to integrate network analysis methods with visualisation in order to address scalability and complexity issues. In particular, we defined new analysis methods such as (p,q)-core and 4-ring to identify important dense subgraphs and short cycles from the huge bipartite graphs. We applied island analysis for a specific time slice in order to identify important and meaningful subgraphs. Further, a temporal Kevin Bacon graph and a temporal two mode network are extracted in order to provide insight and knowledge on the evolution.

Cores are, besides connectivity components, one among few concepts that
ovides us with efficient decompositions of large graphs and networks.
In the paper a generalization of the notion of core of a graph based on
rtex property function is presented. It is shown that for the local monotone
rtex property functions the corresponding cores can be determined in $O(m
ax ( logn))$ time.

The structure of large graphs can be revealed by partitioning graphs to smaller parts, which are easier to handle. In the paper we propose the use of core decomposition as an efficient approach for partitioning large graphs. On the selected subgraphs, computationally more intensive, clustering and blockmodeling can be used to analyze their internal structure. The approach is illustrated by an analysis of Snyder & Kick’s world trade graph.